def test_root_wins_losses_propagation():
tree = GameTree()
tree.run(10)
wins = sum(tree.root.children.wins)
losses = sum(tree.root.children.losses)
assert wins == tree.root.wins or wins + 1 == tree.root.wins
assert losses == tree.root.losses or losses + 1 == tree.root.losses
class MCTSPlayer(Player):
DEFAULT_NAME = 'MCTS'
DEFAULT_ITERATIONS = 100
def __init__(self, name: str = None, iterations: int = DEFAULT_ITERATIONS):
super(MCTSPlayer, self).__init__(name)
self.tree = None
self.iterations = iterations
def get_move(self, game: Game):
if not self.tree:
self.tree = GameTree(game_state=game)
best_move = self.tree.run(self.iterations)
return best_move
def update_state(self, move):
if self.tree:
self.tree.play(move)
@property
def stats(self):
return {
'tree_height': self.tree.height,
'tree_exploration': self.tree.exploration_rate,
'tree_nodes': self.tree.nodes
}
def clone(self):
return MCTSPlayer(self.name, self.iterations)
def test_tree_policy():
tree = GameTree()
assert tree.tree_policy() != tree.root
assert tree.nodes == 2
assert tree.tree_policy()
assert tree.nodes == 3
def test_node_path():
tree = GameTree()
root = tree.root
root.add_children(Node() for _ in range(10))
first_level = list(root.children)[0]
first_level.add_children(Node() for _ in range(5))
leaf = list(first_level.children)[0]
assert leaf.is_leaf
assert list(leaf.path) == [leaf, first_level, root]
def test_create_tree():
tree = GameTree()
assert tree.nodes == 1
assert tree.height == 0
tree.root.add_children(UniqueNode() for _ in range(10))
assert tree.nodes == 11
assert tree.height == 1
list(tree.root.children)[0].add_children(UniqueNode() for _ in range(5))
assert tree.nodes == 16
assert tree.height == 2
def test_node_expand_abilities():
tree = GameTree()
root = tree.root
tree.game.start()
actions = list(ActionGenerator(tree.game))
assert root.is_expandable
for _ in actions:
assert root.is_expandable
tree.expand(root)
assert len(root.children) == len(actions)
tree.expand(root)
assert len(root.children) == len(actions)
assert not root.is_expandable
def get_move(self, game: Game):
if not self.tree:
self.tree = GameTree(game_state=game)
best_move = self.tree.run(self.iterations)
return best_move
def test_node_wins_propagation():
tree = GameTree()
tree.run()
assert tree.root.wins == tree.root.children[0].wins