[pre-commit.ci] auto fixes from pre-commit.com hooks

for more information, see https://pre-commit.ci

Author: pre-commit-ci[bot]

machine_learning/minimax.py

@@ -1,8 +1,14 @@
 import math
 from typing import List
 
-def minimax(depth: int, node_index: int, is_maximizing_player: bool, 
-            scores: List[int], height: int) -> int:
+
+def minimax(
+    depth: int,
+    node_index: int,
+    is_maximizing_player: bool,
+    scores: List[int],
+    height: int,
+) -> int:
     """
     Minimax algorithm to determine the optimal move for a player in a two-player
     zero-sum game.

machine_learning/minimax_alpha_beta_pruning.py

@@ -1,8 +1,16 @@
 import math
 from typing import List
 
-def minimax_with_pruning(depth: int, node_index: int, is_maximizing_player: bool, 
-            scores: List[int], height: int, alpha: int, beta: int) -> int:
+
+def minimax_with_pruning(
+    depth: int,
+    node_index: int,
+    is_maximizing_player: bool,
+    scores: List[int],
+    height: int,
+    alpha: int,
+    beta: int,
+) -> int:
     """
     Minimax algorithm with alpha-beta pruning to determine the optimal
     move with improved efficiency.