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

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

Author: pre-commit-ci[bot]

maths/Game Theory/AlphaBetaPruning/alphabetapruning.py

@@ -1,51 +1,57 @@
 from random import choice
 from math import inf
 
-board = [[0, 0, 0],
-         [0, 0, 0],
-         [0, 0, 0]]
+board = [[0, 0, 0], [0, 0, 0], [0, 0, 0]]
+
 
 def Gameboard(board):
-    chars = {1: 'X', -1: 'O', 0: ' '}
+    chars = {1: "X", -1: "O", 0: " "}
     for x in board:
         for y in x:
             ch = chars[y]
-            print(f'| {ch} |', end='')
-        print('\n' + '---------------')
-    print('===============')
+            print(f"| {ch} |", end="")
+        print("\n" + "---------------")
+    print("===============")
+
 
 def Clearboard(board):
     for x, row in enumerate(board):
         for y, col in enumerate(row):
             board[x][y] = 0
 
+
 def winningPlayer(board, player):
-    conditions = [[board[0][0], board[0][1], board[0][2]],
-                     [board[1][0], board[1][1], board[1][2]],
-                     [board[2][0], board[2][1], board[2][2]],
-                     [board[0][0], board[1][0], board[2][0]],
-                     [board[0][1], board[1][1], board[2][1]],
-                     [board[0][2], board[1][2], board[2][2]],
-                     [board[0][0], board[1][1], board[2][2]],
-                     [board[0][2], board[1][1], board[2][0]]]
+    conditions = [
+        [board[0][0], board[0][1], board[0][2]],
+        [board[1][0], board[1][1], board[1][2]],
+        [board[2][0], board[2][1], board[2][2]],
+        [board[0][0], board[1][0], board[2][0]],
+        [board[0][1], board[1][1], board[2][1]],
+        [board[0][2], board[1][2], board[2][2]],
+        [board[0][0], board[1][1], board[2][2]],
+        [board[0][2], board[1][1], board[2][0]],
+    ]
 
     if [player, player, player] in conditions:
         return True
 
     return False
 
+
 def gameWon(board):
     return winningPlayer(board, 1) or winningPlayer(board, -1)
 
+
 def printResult(board):
     if winningPlayer(board, 1):
-        print('X has won! ' + '\n')
+        print("X has won! " + "\n")
 
     elif winningPlayer(board, -1):
-        print('O\'s have won! ' + '\n')
+        print("O's have won! " + "\n")
 
     else:
-        print('Draw' + '\n')
+        print("Draw" + "\n")
+
 
 def blanks(board):
     blank = []
@@ -56,32 +62,44 @@ def blanks(board):
 
     return blank
 
+
 def boardFull(board):
     if len(blanks(board)) == 0:
         return True
     return False
 
+
 def setMove(board, x, y, player):
     board[x][y] = player
 
+
 def playerMove(board):
     e = True
-    moves = {1: [0, 0], 2: [0, 1], 3: [0, 2],
-             4: [1, 0], 5: [1, 1], 6: [1, 2],
-             7: [2, 0], 8: [2, 1], 9: [2, 2]}
+    moves = {
+        1: [0, 0],
+        2: [0, 1],
+        3: [0, 2],
+        4: [1, 0],
+        5: [1, 1],
+        6: [1, 2],
+        7: [2, 0],
+        8: [2, 1],
+        9: [2, 2],
+    }
     while e:
         try:
-            move = int(input('Enter a number between 1-9: '))
+            move = int(input("Enter a number between 1-9: "))
             if move < 1 or move > 9:
-                print('Invalid Move! Try again!')
+                print("Invalid Move! Try again!")
             elif not (moves[move] in blanks(board)):
-                print('Invalid Move! Try again!')
+                print("Invalid Move! Try again!")
             else:
                 setMove(board, moves[move][0], moves[move][1], 1)
                 Gameboard(board)
                 e = False
-        except(KeyError, ValueError):
-            print('Enter a number!')
+        except (KeyError, ValueError):
+            print("Enter a number!")
+
 
 def getScore(board):
     if winningPlayer(board, 1):
@@ -93,6 +111,7 @@ def getScore(board):
     else:
         return 0
 
+
 def abminimax(board, depth, alpha, beta, player):
     row = -1
     col = -1
@@ -127,6 +146,7 @@ def abminimax(board, depth, alpha, beta, player):
         else:
             return [row, col, beta]
 
+
 def o_comp(board):
     if len(blanks(board)) == 9:
         x = choice([0, 1, 2])
@@ -139,6 +159,7 @@ def o_comp(board):
         setMove(board, result[0], result[1], -1)
         Gameboard(board)
 
+
 def x_comp(board):
     if len(blanks(board)) == 9:
         x = choice([0, 1, 2])
@@ -151,6 +172,7 @@ def x_comp(board):
         setMove(board, result[0], result[1], 1)
         Gameboard(board)
 
+
 def makeMove(board, player, mode):
     if mode == 1:
         if player == 1:
@@ -164,16 +186,17 @@ def makeMove(board, player, mode):
         else:
             x_comp(board)
 
+
 def pvc():
     while True:
         try:
-            order = int(input('Enter to play 1st or 2nd: '))
+            order = int(input("Enter to play 1st or 2nd: "))
             if not (order == 1 or order == 2):
-                print('Please pick 1 or 2')
+                print("Please pick 1 or 2")
             else:
                 break
-        except(KeyError, ValueError):
-            print('Enter a number')
+        except (KeyError, ValueError):
+            print("Enter a number")
 
     Clearboard(board)
     if order == 2:
@@ -187,6 +210,7 @@ def pvc():
 
     printResult(board)
 
+
 # Driver Code
 print("=================================================")
 print("TIC-TAC-TOE using MINIMAX with ALPHA-BETA Pruning")

maths/Game Theory/MonteCarloTreeSearch (MCTS)/monte_carlo_tree_search.py

@@ -4,6 +4,7 @@
 See also https://en.wikipedia.org/wiki/Monte_Carlo_tree_search
 https://gist.github.com/qpwo/c538c6f73727e254fdc7fab81024f6e1
 """
+
 from abc import ABC, abstractmethod
 from collections import defaultdict
 import math
@@ -131,4 +132,4 @@ def __hash__(self):
     @abstractmethod
     def __eq__(node1, node2):
         "Nodes must be comparable"
-        return True
+        return True

maths/Game Theory/MonteCarloTreeSearch (MCTS)/tictactoe.py

@@ -25,6 +25,7 @@
 
 _TTTB = namedtuple("TicTacToeBoard", "tup turn winner terminal")
 
+
 # Inheriting from a namedtuple is convenient because it makes the class
 # immutable and predefines __init__, __repr__, __hash__, __eq__, and others
 class TicTacToeBoard(_TTTB, Node):
@@ -126,4 +127,4 @@ def new_tic_tac_toe_board():
 
 
 if __name__ == "__main__":
-    play_game()
+    play_game()