datamllab / rlcard / 240

Build # 240

Build Type

push

travis-ci

Committed by Daochen

Commit Message

<a href="https://github.com/datamllab/rlcard/commit/<a class=hub.com/datamllab/rlcard/commit/<a class="double-link" href="https://git"><a class=hub.com/datamllab/rlcard/commit/<a class="double-link" href="https://git"><a class=hub.com/datamllab/rlcard/commit/<a class="double-link" href="https://git"><a class=hub.com/datamllab/rlcard/commit/<a class="double-link" href="https://git"><a class=hub.com/datamllab/rlcard/commit/02a537bd2753a1e5a6ca32c28a2eb3b827fb0024">02a537bd2<a href="https://github.com/datamllab/rlcard/commit/02a537bd2753a1e5a6ca32c28a2eb3b827fb0024">&lt;a href=&quot;https://github.com/datamllab/rlcard/commit/02a537bd2753a1e5a6ca32c28a2eb3b827fb0024">&lt;a href=&quot;https://github.com/datamllab/rlcard/commit/02a537bd2753a1e5a6ca32c28a2eb3b827fb0024&quot;&gt;&amp;lt;a href=&amp;quot;https://github.com/datamllab/rlcard/commit/02a537bd2753a1e5a6ca32c28a2eb3b827fb0024&amp;quot;&amp;gt;&amp;amp;lt;a href=&amp;amp;quot;https://github.com/datamllab/rlcard/commit/02a537bd2753a1e5a6ca32c28a2eb3b827fb0024&amp;amp;quot;&amp;amp;gt;&amp;amp;amp;quot;&amp;amp;amp;gt;Squashed commit of the following:

commit &amp;amp;lt;/a&amp;amp;gt;&amp;amp;lt;a class=&amp;amp;quot;double-link&amp;amp;quot; href=&amp;amp;quot;https://github.com/datamllab/rlcard/commit/&amp;amp;lt;a class=&amp;amp;quot;double-link&amp;amp;quot; href=&amp;amp;quot;https://github.com/datamllab/rlcard/commit/32abdb3705e677688190394f7766e7fcbdb7556a&amp;amp;quot;&amp;amp;gt;32abdb370&amp;amp;lt;/a&amp;amp;gt;&amp;amp;quot;&amp;amp;gt;32abdb370&amp;amp;lt;/a&amp;amp;gt;&amp;amp;lt;a href=&amp;amp;quot;https://github.com/datamllab/rlcard/commit/02a537bd2753a1e5a6ca32c28a2eb3b827fb0024&amp;quot;&amp;gt;
Merge: 18b65b1 d462bf3
Author: songyih &amp;amp;lt;songyih1996@gmail.com&amp;amp;gt;
Date:   Tue Oct 8 18:52:36 2019 -0700

    Merge branch &amp;amp;#39;dev&amp;amp;#39; of https://github.com/datamllab/rlcard into dev

commit &amp;lt;/a&amp;gt;&amp;lt;a class=&amp;quot;double-link&amp;quot; href=&amp;quot;https://github.com/datamllab/rlcard/commit/&amp;lt;a class=&amp;quot;double-link&amp;quot; href=&amp;quot;https://github.com/datamllab/rlcard/commit/d462bf35ba46d982f803bcefdeaf1476c8d96c75&amp;quot;&gt;d462bf35b&lt;/a&gt;&quot;&gt;d462bf35b&lt;/a&gt;&lt;a href=&quot;https://github.com/datamllab/rlcard/commit/02a537bd2753a1e5a6ca32c28a2eb3b827fb0024&quot;&gt;
Author: Kwei-Herng Lai &amp;lt;khlai037@datalab3.engr.tamu.edu&amp;gt;
Date:   Tue Oct 8 18:51:59 2019 -0700

    mahjong (fix table)

commit &lt;/a&gt;&lt;a class=&quot;double-link&quot; href=&quot;https://github.com/datamllab/rlcard/commit/&lt;a class=&quot;double-link&quot; href=&quot;https://github.com/datamllab/rlcard/commit/18b65b18334df5f8442aceff9123374505ddfcb1&quot;&gt;18b65b183&lt;/a&gt;&quot;&gt;18b65b183&lt;/a&gt;&lt;a href=&quot;https://github.com/datamllab/rlcard/commit/02a537bd2753a1e5a6ca32c28a2eb3b827fb0024">
Author: songyih &lt;songyih1996@gmail.com&gt;
Date:   Tue Oct 8 18:50:50 2019 -0700

    setup.py for pip hosting

commit </a><a class="double-link" href="https://github.com/datamllab/rlcard/commit/<a class="double-link" href="https://github.com/datamllab/rlcard/commit/f54c6e3812267646dcbbee1fe427319a107c6153">f54c6e381</a>">f54c6e381</a><a href="https://github.com/datamllab/rlcard/commit/02a537bd2753a1e5a6ca32c28a2eb3b827fb0024">
Author: Kwei-Herng Lai &lt;khlai037@datalab3.engr.tamu.edu&gt;
Date:   Tue Oct 8 18:50:38 2019 -0700

    mahjong (table)

commit </a><a class="double-link" href="https://github.com/datamllab/rlcard/commit/bfd6e149a">bfd6e149a
Author: songyih <songyih1996@gmail.com>
Date:   Tue Oct 8 18:49:38 2019 -0700

    setup.py for pip hosting

commit 
94.25

/rlcard/utils/utils.py

import random
import numpy as np

from rlcard.core import Card, Player


def init_standard_deck():
    ''' Initialize a standard deck of 52 cards

    Returns:
        (list): A list of Card object
    '''
    suit_list = ['S', 'H', 'D', 'C']
    rank_list = ['A', '2', '3', '4', '5', '6', '7', '8', '9', 'T', 'J', 'Q', 'K']
    res = [Card(suit, rank) for suit in suit_list for rank in rank_list]
    return res

def init_54_deck():
    ''' Initialize a standard deck of 52 cards, BJ and RJ

    Returns:
        (list): Alist of Card object
    '''
    suit_list = ['S', 'H', 'D', 'C']
    rank_list = ['A', '2', '3', '4', '5', '6', '7', '8', '9', 'T', 'J', 'Q', 'K']
    res = [Card(suit, rank) for suit in suit_list for rank in rank_list]
    res.append(Card('BJ', ''))
    res.append(Card('RJ', ''))
    return res


def get_random_cards(cards, num, seed=None):
    ''' Randomly get a number of chosen cards out of a list of cards

    Args:
        cards (list): List of Card object
        num (int): The  number of cards to be chosen
        seed (int): Optional, random seed

    Returns:
        (list): A list of chosen cards
        (list): A list of remained cards
    '''
    if not num> 0:
        raise AssertionError('Invalid input number')
    if not num <= len(cards):
        raise AssertionError('Input number larger than length of cards')
    remained_cards = []
    chosen_cards = []
    remained_cards = cards.copy()
    random.Random(seed).shuffle(remained_cards)
    chosen_cards = remained_cards[:num]
    remained_cards = remained_cards[num:]
    return chosen_cards, remained_cards

def is_pair(cards):
    ''' Check whether the card is a pair

    Args:
        cards (list): A list of Card object

    Returns:
        (boolean): True if the list is a pair
    '''
    if len(cards) == 2 and cards[0].rank == cards[1].rank:
        return True
    else:
        return False

def is_single(cards):
    ''' Check whether the card is singel

    Args:
        cards (list): A list of Card object

    Returns:
        (boolean): True if the list is single
    '''
    if len(cards) == 1:
        return True
    else:
        return False

def rank2int(rank):
    ''' Get the coresponding number of a rank.

    Args:
        rank(str): rank stored in Card object

    Returns:
        (int): the number corresponding to the rank

    Note:
        1. If the input rank is an empty string, the function will return -1.
        2. If the input rank is not valid, the function will return None.
    '''
    if rank == '':
        return -1
    elif rank.isdigit():
        if int(rank) >= 2 and int(rank) <= 10:
            return int(rank)
        else:
            return None
    elif rank == 'A':
        return 14
    elif rank == 'T':
        return 10
    elif rank == 'J':
        return 11
    elif rank == 'Q':
        return 12
    elif rank == 'K':
        return 13
    return None

def get_cards_from_ranks(player, ranks):
    ''' Get chosen cards and remained cards from a player's hand according to input rank list

    Args:
        player (Player): Player object
        ranks (list): A list of rank (string)

    Returns:
        (tupel): Tuple containing:
            (list): A list of Card objects, chosen cards
            (list): A list of Card objects, remained cards

    Note: This function will not affect the player's original hand.
    '''
    chosen_cards = []
    remained_cards = player.hand.copy()
    for rank in ranks:
        for card in remained_cards:
            if card.rank == rank:
                chosen_cards.append(card)
                remained_cards.pop(remained_cards.index(card))
    return chosen_cards, remained_cards

def take_out_cards(cards, remove_cards):
    ''' Take out specific cards from a list of cards

    Args:
        cards (list): A list of Card objects from which to be taken out some cards
        remove_cards (list): A list of Card objects that need to be taken out

    Returns:
        (list): A list of Card objects. The cards in 'remove_cards' list that doesn't make cards in 'cards' list taken out

    Note:
        1. This function will affect the first input Card list,
        but will not affect the second input Card list.
        2. For each card in 'remove_cards' list, it will make only one card in 'cards' list taken out,
        which means to take out one kind of cards with the same suit and rank in 'cards' list,
        you need to have the same number of cards with the same suit and rank in 'remove_cards' list.
    '''
    remove_cards_cp = remove_cards
    for card in cards:
        for remove_card in remove_cards_cp:
            if card.rank == remove_card.rank and card.suit == remove_card.suit:
                cards.pop(cards.index(card))
                remove_cards_cp.pop(remove_cards_cp.index(remove_card))
    return remove_cards_cp

def is_in_cards(origin_cards, check_cards):
    ''' Check if a list of Card objects contains another list of Card objects

    Args:
        cards (list): A list of Card objects which to be checked if it contains another list of Card objects
        check_cards (list): A list of Card objects which to be checked if it is in a list of Card objecrts

    Returns:
        (boolean): True if the cards are in the original cards.
    '''
    check_cards_cp = check_cards.copy()
    cards = origin_cards.copy()
    i = 0
    while i < len(check_cards_cp):
        j = 0
        while j < len(cards):
            if cards[j].rank == check_cards_cp[i].rank and cards[j].suit == check_cards_cp[i].suit:
                cards.pop(j)
                check_cards_cp.pop(i)
                if(len(cards) == 0 or len(check_cards_cp) == 0):
                    break
                j -= 1
            j += 1
        if(len(cards) == 0 or len(check_cards_cp) == 0):
            break
        i += 1
    return len(check_cards_cp) == 0

def elegent_form(card):
    ''' Get a elegent form of a card string

    Args:
        card (string): A card string

    Returns:
        elegent_card (string): A nice form of card
    '''
    suits = {'S': '♠', 'H': '♥', 'D': '♦', 'C': '♣','s': '♠', 'h': '♥', 'd': '♦', 'c': '♣' }
    rank = '10' if card[1] == 'T' else card[1]

    return suits[card[0]] + rank

def print_card(cards):
    ''' Nicely print a card or list of cards

    Args:
        card (string or list): The card(s) to be printed
    '''
    if cards == None:
        cards = [None]
    if isinstance(cards, str):
        cards = [cards]

    lines = [[] for _ in range(9)]

    for card in cards:
        if card == None:
            lines[0].append('┌─────────┐')
            lines[1].append('│░░░░░░░░░│')
            lines[2].append('│░░░░░░░░░│')
            lines[3].append('│░░░░░░░░░│')
            lines[4].append('│░░░░░░░░░│')
            lines[5].append('│░░░░░░░░░│')
            lines[6].append('│░░░░░░░░░│')
            lines[7].append('│░░░░░░░░░│')
            lines[8].append('└─────────┘')
        else:
            elegent_card = elegent_form(card)
            suit = elegent_card[0]
            rank = elegent_card[1]
            if len(elegent_card) == 3:
                space = elegent_card[2]
            else:
                space = ' '

            lines[0].append('┌─────────┐')
            lines[1].append('│{}{}       │'.format(rank, space))
            lines[2].append('│         │')
            lines[3].append('│         │')
            lines[4].append('│    {}    │'.format(suit))
            lines[5].append('│         │')
            lines[6].append('│         │')
            lines[7].append('│       {}{}│'.format(space, rank))
            lines[8].append('└─────────┘')

    for line in lines:
        print ('   '.join(line))



def init_players(n):
    ''' Initilize a list of Player objects with n players

    Args:
        n (int): The number of players to be initialized

    Returns:
        (list): A list of Player objects with player_id(s) start from 0 and are consequent
    '''

    players = []
    for idx in range(n):
        players.append(Player(idx))
    return players

def get_upstream_player_id(player, players):
    ''' Obtain the upsteam player's player_id

    Args:
        player (Player): The current player
        players (list): A list of players

    Note: This function assumes player_id(s) in 'players' list starts from 0, and are consequent.
    '''
    return (player.player_id-1)%len(players)

def get_downstream_player_id(player, players):
    ''' Obtain the downsteam player's player_id

    Args:
        player (Player): The current player
        players (list): A list of players

    Note: This function assumes player_id(s) in 'players' list start from 0, and are consequent.
    '''

    return (player.player_id+1)%len(players)

def reorganize(trajectories, payoffs):
    ''' Reorganize the trajectory to make it RL friendly

    Args:
        trajectory (list): A list of trajectories
        payoffs (list): A list of payoffs for the players. Each entry corresponds to one player

    Returns:
        (list): A new trajectories that can be fed into RL algorithms.

    '''
    player_num = len(trajectories)
    new_trajectories = [[] for _ in range(player_num)]

    for player in range(player_num):
        for i in range(0, len(trajectories[player])-2, 2):
            if i ==len(trajectories[player])-3:
                reward = payoffs[player]
                done =True
            else:
                reward, done = 0, False
            transition = trajectories[player][i:i+3].copy()
            transition.insert(2, reward)
            transition.append(done)

            new_trajectories[player].append(transition)
    return new_trajectories

def set_global_seed(seed):
    ''' Set the global see for reproducing results

    Args:
        seed (int): The seed

    Note: If using other modules with randomness, they also need to be seeded
    '''
    if seed is not None:
        import tensorflow as tf
        tf.set_random_seed(seed)
        np.random.seed(seed)
        random.seed(seed)

def remove_illegal(action_probs, legal_actions):
    ''' Remove illegal actions and normalize the
        probability vector

    Args:
        action_probs (numpy.array): A 1 dimention numpy array.
        legal_actions (list): A list of indices of legal actions.

    Returns:
        probd (numpy.array): A normalized vector without legal actions.
    '''
    probs = np.zeros(action_probs.shape[0])
    probs[legal_actions] = action_probs[legal_actions]
    if np.sum(probs) == 0:
        probs[legal_actions] = 1 / len(legal_actions)
    else:
        probs /= sum(probs)
    return probs

def make_copy_params_op(v1_list, v2_list):
    v1_list = list(sorted(v1_list, key=lambda v: v.scope))
    v2_list = list(sorted(v2_list, key=lambda v: v.scope))

    update_ops = []
    for v1, v2 in zip(v1_list, v2_list):
        op = v2.assign(v1)
        update_ops.append(op)
    return update_ops

def assign_task(task_num, process_num):
    per_tasks = [task_num // process_num] * process_num
    per_tasks[0] += (task_num % process_num)
    return per_tasks

1	import random	1✔
2	import numpy as np	1✔
3
4	from rlcard.core import Card, Player	1✔
5
6
7	def init_standard_deck():	1✔
8	''' Initialize a standard deck of 52 cards
9
10	Returns:
11	(list): A list of Card object
12	'''
13	suit_list = ['S', 'H', 'D', 'C']	1✔
14	rank_list = ['A', '2', '3', '4', '5', '6', '7', '8', '9', 'T', 'J', 'Q', 'K']	1✔
15	res = [Card(suit, rank) for suit in suit_list for rank in rank_list]	1✔
16	return res	1✔
17
18	def init_54_deck():	1✔
19	''' Initialize a standard deck of 52 cards, BJ and RJ
20
21	Returns:
22	(list): Alist of Card object
23	'''
24	suit_list = ['S', 'H', 'D', 'C']	1✔
25	rank_list = ['A', '2', '3', '4', '5', '6', '7', '8', '9', 'T', 'J', 'Q', 'K']	1✔
26	res = [Card(suit, rank) for suit in suit_list for rank in rank_list]	1✔
27	res.append(Card('BJ', ''))	1✔
28	res.append(Card('RJ', ''))	1✔
29	return res	1✔
30
31
32	def get_random_cards(cards, num, seed=None):	1✔
33	''' Randomly get a number of chosen cards out of a list of cards
34
35	Args:
36	cards (list): List of Card object
37	num (int): The number of cards to be chosen
38	seed (int): Optional, random seed
39
40	Returns:
41	(list): A list of chosen cards
42	(list): A list of remained cards
43	'''
44	if not num> 0:	1✔
45	raise AssertionError('Invalid input number')	1✔
46	if not num <= len(cards):	1✔
47	raise AssertionError('Input number larger than length of cards')	1✔
48	remained_cards = []	1✔
49	chosen_cards = []	1✔
50	remained_cards = cards.copy()	1✔
51	random.Random(seed).shuffle(remained_cards)	1✔
52	chosen_cards = remained_cards[:num]	1✔
53	remained_cards = remained_cards[num:]	1✔
54	return chosen_cards, remained_cards	1✔
55
56	def is_pair(cards):	1✔
57	''' Check whether the card is a pair
58
59	Args:
60	cards (list): A list of Card object
61
62	Returns:
63	(boolean): True if the list is a pair
64	'''
65	if len(cards) == 2 and cards[0].rank == cards[1].rank:	1✔
66	return True	1✔
67	else:
68	return False	1✔
69
70	def is_single(cards):	1✔
71	''' Check whether the card is singel
72
73	Args:
74	cards (list): A list of Card object
75
76	Returns:
77	(boolean): True if the list is single
78	'''
79	if len(cards) == 1:	1✔
80	return True	1✔
81	else:
82	return False	1✔
83
84	def rank2int(rank):	1✔
85	''' Get the coresponding number of a rank.
86
87	Args:
88	rank(str): rank stored in Card object
89
90	Returns:
91	(int): the number corresponding to the rank
92
93	Note:
94	1. If the input rank is an empty string, the function will return -1.
95	2. If the input rank is not valid, the function will return None.
96	'''
97	if rank == '':	1✔
98	return -1	1✔
99	elif rank.isdigit():	1✔
100	if int(rank) >= 2 and int(rank) <= 10:	1✔
101	return int(rank)	1✔
102	else:
103	return None	1✔
104	elif rank == 'A':	1✔
105	return 14	1✔
106	elif rank == 'T':	1✔
107	return 10	1✔
108	elif rank == 'J':	1✔
109	return 11	1✔
110	elif rank == 'Q':	1✔
111	return 12	1✔
112	elif rank == 'K':	1✔
113	return 13	1✔
114	return None	1✔
115
116	def get_cards_from_ranks(player, ranks):	1✔
117	''' Get chosen cards and remained cards from a player's hand according to input rank list
118
119	Args:
120	player (Player): Player object
121	ranks (list): A list of rank (string)
122
123	Returns:
124	(tupel): Tuple containing:
125	(list): A list of Card objects, chosen cards
126	(list): A list of Card objects, remained cards
127
128	Note: This function will not affect the player's original hand.
129	'''
130	chosen_cards = []	1✔
131	remained_cards = player.hand.copy()	1✔
132	for rank in ranks:	1✔
133	for card in remained_cards:	1✔
134	if card.rank == rank:	1✔
135	chosen_cards.append(card)	1✔
136	remained_cards.pop(remained_cards.index(card))	1✔
137	return chosen_cards, remained_cards	1✔
138
139	def take_out_cards(cards, remove_cards):	1✔
140	''' Take out specific cards from a list of cards
141
142	Args:
143	cards (list): A list of Card objects from which to be taken out some cards
144	remove_cards (list): A list of Card objects that need to be taken out
145
146	Returns:
147	(list): A list of Card objects. The cards in 'remove_cards' list that doesn't make cards in 'cards' list taken out
148
149	Note:
150	1. This function will affect the first input Card list,
151	but will not affect the second input Card list.
152	2. For each card in 'remove_cards' list, it will make only one card in 'cards' list taken out,
153	which means to take out one kind of cards with the same suit and rank in 'cards' list,
154	you need to have the same number of cards with the same suit and rank in 'remove_cards' list.
155	'''
156	remove_cards_cp = remove_cards	1✔
157	for card in cards:	1✔
158	for remove_card in remove_cards_cp:	1✔
159	if card.rank == remove_card.rank and card.suit == remove_card.suit:	1✔
160	cards.pop(cards.index(card))	1✔
161	remove_cards_cp.pop(remove_cards_cp.index(remove_card))	1✔
162	return remove_cards_cp	1✔
163
164	def is_in_cards(origin_cards, check_cards):	1✔
165	''' Check if a list of Card objects contains another list of Card objects
166
167	Args:
168	cards (list): A list of Card objects which to be checked if it contains another list of Card objects
169	check_cards (list): A list of Card objects which to be checked if it is in a list of Card objecrts
170
171	Returns:
172	(boolean): True if the cards are in the original cards.
173	'''
174	check_cards_cp = check_cards.copy()	1✔
175	cards = origin_cards.copy()	1✔
176	i = 0	1✔
177	while i < len(check_cards_cp):	1✔
178	j = 0	1✔
179	while j < len(cards):	1✔
180	if cards[j].rank == check_cards_cp[i].rank and cards[j].suit == check_cards_cp[i].suit:	1✔
181	cards.pop(j)	1✔
182	check_cards_cp.pop(i)	1✔
183	if(len(cards) == 0 or len(check_cards_cp) == 0):	1✔
184	break	1✔
185	j -= 1	1✔
186	j += 1	1✔
187	if(len(cards) == 0 or len(check_cards_cp) == 0):	1✔
188	break	1✔
189	i += 1	1✔
190	return len(check_cards_cp) == 0	1✔
191
192	def elegent_form(card):	1✔
193	''' Get a elegent form of a card string
194
195	Args:
196	card (string): A card string
197
198	Returns:
199	elegent_card (string): A nice form of card
200	'''
201	suits = {'S': '♠', 'H': '♥', 'D': '♦', 'C': '♣','s': '♠', 'h': '♥', 'd': '♦', 'c': '♣' }	1✔
202	rank = '10' if card[1] == 'T' else card[1]	1✔
203
204	return suits[card[0]] + rank	1✔
205
206	def print_card(cards):	1✔
207	''' Nicely print a card or list of cards
208
209	Args:
210	card (string or list): The card(s) to be printed
211	'''
212	if cards == None:	1✔
213	cards = [None]	1✔
214	if isinstance(cards, str):	1✔
215	cards = [cards]	1✔
216
217	lines = [[] for _ in range(9)]	1✔
218
219	for card in cards:	1✔
220	if card == None:	1✔
221	lines[0].append('┌─────────┐')	1✔
222	lines[1].append('│░░░░░░░░░│')	1✔
223	lines[2].append('│░░░░░░░░░│')	1✔
224	lines[3].append('│░░░░░░░░░│')	1✔
225	lines[4].append('│░░░░░░░░░│')	1✔
226	lines[5].append('│░░░░░░░░░│')	1✔
227	lines[6].append('│░░░░░░░░░│')	1✔
228	lines[7].append('│░░░░░░░░░│')	1✔
229	lines[8].append('└─────────┘')	1✔
230	else:
231	elegent_card = elegent_form(card)	1✔
232	suit = elegent_card[0]	1✔
233	rank = elegent_card[1]	1✔
234	if len(elegent_card) == 3:	1✔
235	space = elegent_card[2]	1✔
236	else:
237	space = ' '	1✔
238
239	lines[0].append('┌─────────┐')	1✔
240	lines[1].append('│{}{} │'.format(rank, space))	1✔
241	lines[2].append('│ │')	1✔
242	lines[3].append('│ │')	1✔
243	lines[4].append('│ {} │'.format(suit))	1✔
244	lines[5].append('│ │')	1✔
245	lines[6].append('│ │')	1✔
246	lines[7].append('│ {}{}│'.format(space, rank))	1✔
247	lines[8].append('└─────────┘')	1✔
248
249	for line in lines:	1✔
250	print (' '.join(line))	1✔
251
252
253
254	def init_players(n):	1✔
255	''' Initilize a list of Player objects with n players
256
257	Args:
258	n (int): The number of players to be initialized
259
260	Returns:
261	(list): A list of Player objects with player_id(s) start from 0 and are consequent
262	'''
263
264	players = []	1✔
265	for idx in range(n):	1✔
266	players.append(Player(idx))	1✔
267	return players	1✔
268
269	def get_upstream_player_id(player, players):	1✔
270	''' Obtain the upsteam player's player_id
271
272	Args:
273	player (Player): The current player
274	players (list): A list of players
275
276	Note: This function assumes player_id(s) in 'players' list starts from 0, and are consequent.
277	'''
278	return (player.player_id-1)%len(players)	1✔
279
280	def get_downstream_player_id(player, players):	1✔
281	''' Obtain the downsteam player's player_id
282
283	Args:
284	player (Player): The current player
285	players (list): A list of players
286
287	Note: This function assumes player_id(s) in 'players' list start from 0, and are consequent.
288	'''
289
290	return (player.player_id+1)%len(players)	1✔
291
292	def reorganize(trajectories, payoffs):	1✔
293	''' Reorganize the trajectory to make it RL friendly
294
295	Args:
296	trajectory (list): A list of trajectories
297	payoffs (list): A list of payoffs for the players. Each entry corresponds to one player
298
299	Returns:
300	(list): A new trajectories that can be fed into RL algorithms.
301
302	'''
303	player_num = len(trajectories)	1✔
304	new_trajectories = [[] for _ in range(player_num)]	1✔
305
306	for player in range(player_num):	1✔
307	for i in range(0, len(trajectories[player])-2, 2):	1✔
308	if i ==len(trajectories[player])-3:	1✔
309	reward = payoffs[player]	1✔
310	done =True	1✔
311	else:
312	reward, done = 0, False	1✔
313	transition = trajectories[player][i:i+3].copy()	1✔
314	transition.insert(2, reward)	1✔
315	transition.append(done)	1✔
316
317	new_trajectories[player].append(transition)	1✔
318	return new_trajectories	1✔
319
320	def set_global_seed(seed):	1✔
321	''' Set the global see for reproducing results
322
323	Args:
324	seed (int): The seed
325
326	Note: If using other modules with randomness, they also need to be seeded
327	'''
328	if seed is not None:	1✔
329	import tensorflow as tf	1✔
330	tf.set_random_seed(seed)	1✔
331	np.random.seed(seed)	1✔
332	random.seed(seed)	1✔
333
334	def remove_illegal(action_probs, legal_actions):	1✔
335	''' Remove illegal actions and normalize the
336	probability vector
337
338	Args:
339	action_probs (numpy.array): A 1 dimention numpy array.
340	legal_actions (list): A list of indices of legal actions.
341
342	Returns:
343	probd (numpy.array): A normalized vector without legal actions.
344	'''
345	probs = np.zeros(action_probs.shape[0])	1✔
346	probs[legal_actions] = action_probs[legal_actions]	1✔
347	if np.sum(probs) == 0:	1✔
348	probs[legal_actions] = 1 / len(legal_actions)	1✔
349	else:
350	probs /= sum(probs)	1✔
351	return probs	1✔
352
353	def make_copy_params_op(v1_list, v2_list):	1✔
354	v1_list = list(sorted(v1_list, key=lambda v: v.scope))	×
355	v2_list = list(sorted(v2_list, key=lambda v: v.scope))	×
356
357	update_ops = []	×
358	for v1, v2 in zip(v1_list, v2_list):	×
359	op = v2.assign(v1)	×
360	update_ops.append(op)	×
361	return update_ops	×
362
363	def assign_task(task_num, process_num):	1✔
364	per_tasks = [task_num // process_num] * process_num	×
365	per_tasks[0] += (task_num % process_num)	×
366	return per_tasks	×