Implementing utils.best_move_from_tree

hrushikeshrv · Feb 1, 2023 · af30fe4 · af30fe4
1 parent 6d27896
commit af30fe4
Show file tree

Hide file tree

Showing 6 changed files with 174,036 additions and 893,435 deletions.
diff --git a/chessengine/bitboard.py b/chessengine/bitboard.py
@@ -972,12 +972,12 @@ def play(self, search_depth: int = 4) -> None:
         side_to_move = "white"
         in_game_tree = parser is not None
         current_node = parser.root_node if in_game_tree else None
-        lines_printed = 20
+        lines_printed = 11
         last_move = ""
         while True:
             clear_lines(lines_printed)
             print(self)
-            lines_printed = 20
+            lines_printed = 11
             if side_to_move == self.side:
                 if in_game_tree:
                     move, node = random.choice(list(current_node.children.items()))