def move(self):
Resources.display()
node = Resources.Node((self.row, Resources.BOARD))
highest_val, best_move = search.search(node, self.row)
print "%s moves" % self.name, best_move
return do_move(best_move, self.row, Resources.BOARD)
def move(self):
b = Resources.BOARD
s = Resources.BOARD_SIZE
if not any(Resources.BOARD[self.row*s+1:(self.row+1)*s-1]):
print "%s's row is empty. giving turn to next player" % self.name
return (self.row+1)%Resources.NUM_PLAYERS, None
Resources.display()
node = Resources.Node((self.row, Resources.BOARD))
highest_val, best_move = search.search(node, self)
print '%s moves' % self.name, best_move
return do_move(best_move, self.row, Resources.BOARD)
