azalea/CSC111
1
0
Fork 0
Code Issues Pull Requests Actions Packages Projects Releases Wiki Activity

[+] A2 P2.2 Add more tests

Browse Source
This commit is contained in:
wuliaozhiji
2022-02-19 15:19:30 -05:00
parent cc6058b239
commit 806ad621f3
1 changed files with 8 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files
assignments/A2/a2_part2.py
+8 -1
View File
@@ -75,14 +75,21 @@ def generate_complete_game_tree(root_move: str, game_state: a2_minichess.Miniche
>>> g.make_move('b2c3') >>> g.make_move('b2c3')
>>> g.make_move('b3c4') >>> g.make_move('b3c4')
>>> t = generate_complete_game_tree('b3c4', g, 3) >>> t = generate_complete_game_tree('b3c4', g, 3)
>>> t.white_win_probability
1.0
>>> len(t.get_subtrees()) >>> len(t.get_subtrees())
9 9
>>> t = t.find_subtree_by_move('b1a2') >>> t = t.find_subtree_by_move('b1a2')
>>> len(t.get_subtrees()) >>> len(t.get_subtrees())
0 0
>>> t.white_win_probability
1.0
>>> t = generate_complete_game_tree('*', g, 4)
>>> t.white_win_probability
1.0
""" """
tree = a2_game_tree.GameTree(root_move, game_state.is_white_move(), tree = a2_game_tree.GameTree(root_move, game_state.is_white_move(),
int(game_state.get_winner() == 'White')) float(game_state.get_winner() == 'White'))
# Base case # Base case
if d == 0: if d == 0: