First implementation of Iterative Deepening MinMax

src/classes/Engines.py

@@ -1,4 +1,4 @@
-import random, math
+import random, math, time
 
 class PlayerEngine:
     def __init__(self, player, logger, heuristic, options: dict = {}):
@@ -189,3 +189,58 @@ class AlphabetaPlayerEngine(PlayerEngine):
                     ))
                     return alpha, nodes, leafs
             return beta, nodes, leafs
+
+class MinmaxDeepeningPlayerEngine(PlayerEngine):
+    
+    def get_move(self, board):
+        super().get_move(board)
+        value = -math.inf
+        nodes = 1
+        leafs = 0
+        move = ''
+        start_time = time.time()
+        for m in board.legal_moves():
+            board.push(m)
+            v, n, l = self.checkMinMax(board, False, start_time)
+            if v > value:
+                value = v
+                move = m
+                self.logger.debug("found a better move: {} (heuristic:{})".format(
+                    move,
+                    value
+                    ))
+            nodes += n
+            leafs += l
+            board.pop()
+        return move
+
+    def checkMinMax(self, board, friend_move:bool, start_time):
+        nodes = 1
+        leafs = 0
+        move = ''
+        if time.time() >= start_time + self.options['time_limit'] or board.is_game_over():
+            leafs +=1
+            return self.heuristic.get(board, self.player), nodes, leafs
+        
+        if friend_move:
+            value = -math.inf
+            for m in board.legal_moves():
+                board.push(m)
+                v, n, l = self.checkMinMax(board, False, start_time)
+                if v > value:
+                    value = v
+                nodes += n
+                leafs += l
+                board.pop()
+
+        else:
+            value = math.inf
+            for m in board.legal_moves():
+                board.push(m)
+                v, n, l = self.checkMinMax(board, True, start_time)
+                if v < value:
+                    value = v
+                board.pop();
+                nodes += n
+                leafs += l
+        return value, nodes, leafs