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

[O] Better implementation for insert_move_sequence

Browse Source
This commit is contained in:
wuliaozhiji
2022-02-19 15:08:05 -05:00
parent 2a3d3add9e
commit 0940118916
1 changed files with 7 additions and 8 deletions
Download Patch File Download Diff File Expand all files Collapse all files
assignments/A2/a2_game_tree.py
+7 -8
View File
@@ -173,15 +173,14 @@ class GameTree:
if index == len(moves): if index == len(moves):
return return
# Next root already exists sub = self.find_subtree_by_move(moves[index])
for c in self._subtrees:
if c.move == moves[index]:
c.insert_move_sequence_helper(moves, index + 1)
return
# Next root doesn't exist # Create subtree if not exist
sub = GameTree(moves[index], not self.is_white_move) if not sub:
self.add_subtree(sub) sub = GameTree(moves[index], not self.is_white_move)
self.add_subtree(sub)
# Insert move
sub.insert_move_sequence_helper(moves, index + 1) sub.insert_move_sequence_helper(moves, index + 1)
############################################################################ ############################################################################