From 00f8d464a8ccedc490c195124f651107e0bb254e Mon Sep 17 00:00:00 2001 From: PritamP20 <102867939+PritamP20@users.noreply.github.com> Date: Fri, 7 Oct 2022 19:04:04 +0530 Subject: [PATCH 1/6] Create TicTacToe.py --- scripts/MiniMaxAlgo/TicTacToe.py | 102 +++++++++++++++++++++++++++++++ 1 file changed, 102 insertions(+) create mode 100644 scripts/MiniMaxAlgo/TicTacToe.py diff --git a/scripts/MiniMaxAlgo/TicTacToe.py b/scripts/MiniMaxAlgo/TicTacToe.py new file mode 100644 index 0000000..5e9545a --- /dev/null +++ b/scripts/MiniMaxAlgo/TicTacToe.py @@ -0,0 +1,102 @@ +import math +import time +from player import HumanPlayer, RandomComputerPlayer + + +class TicTacToe(): + def __init__(self): + self.board = self.make_board() + self.current_winner = None + + @staticmethod + def make_board(): + return [' ' for _ in range(9)] + + def print_board(self): + for row in [self.board[i*3:(i+1) * 3] for i in range(3)]: + print('| ' + ' | '.join(row) + ' |') + + @staticmethod + def print_board_nums(): + # 0 | 1 | 2 + number_board = [[str(i) for i in range(j*3, (j+1)*3)] for j in range(3)] + for row in number_board: + print('| ' + ' | '.join(row) + ' |') + + def make_move(self, square, letter): + if self.board[square] == ' ': + self.board[square] = letter + if self.winner(square, letter): + self.current_winner = letter + return True + return False + + def winner(self, square, letter): + # check the row + row_ind = math.floor(square / 3) + row = self.board[row_ind*3:(row_ind+1)*3] + # print('row', row) + if all([s == letter for s in row]): + return True + col_ind = square % 3 + column = [self.board[col_ind+i*3] for i in range(3)] + # print('col', column) + if all([s == letter for s in column]): + return True + if square % 2 == 0: + diagonal1 = [self.board[i] for i in [0, 4, 8]] + # print('diag1', diagonal1) + if all([s == letter for s in diagonal1]): + return True + diagonal2 = [self.board[i] for i in [2, 4, 6]] + # print('diag2', diagonal2) + if all([s == letter for s in diagonal2]): + return True + return False + + def empty_squares(self): + return ' ' in self.board + + def num_empty_squares(self): + return self.board.count(' ') + + def available_moves(self): + return [i for i, x in enumerate(self.board) if x == " "] + + +def play(game, x_player, o_player, print_game=True): + + if print_game: + game.print_board_nums() + + letter = 'X' + while game.empty_squares(): + if letter == 'O': + square = o_player.get_move(game) + else: + square = x_player.get_move(game) + if game.make_move(square, letter): + + if print_game: + print(letter + ' makes a move to square {}'.format(square)) + game.print_board() + print('') + + if game.current_winner: + if print_game: + print(letter + ' wins!') + return letter # ends the loop and exits the game + letter = 'O' if letter == 'X' else 'X' # switches player + + time.sleep(.8) + + if print_game: + print('It\'s a tie!') + + + +if __name__ == '__main__': + x_player = SmartComputerPlayer('X') + o_player = HumanPlayer('O') + t = TicTacToe() + play(t, x_player, o_player, print_game=True) From 75956545ba65770f5d70551bcc27f4711ee31cd6 Mon Sep 17 00:00:00 2001 From: PritamP20 <102867939+PritamP20@users.noreply.github.com> Date: Fri, 7 Oct 2022 19:05:09 +0530 Subject: [PATCH 2/6] Create player.py --- scripts/MiniMaxAlgo/player.py | 38 +++++++++++++++++++++++++++++++++++ 1 file changed, 38 insertions(+) create mode 100644 scripts/MiniMaxAlgo/player.py diff --git a/scripts/MiniMaxAlgo/player.py b/scripts/MiniMaxAlgo/player.py new file mode 100644 index 0000000..2ffe8cc --- /dev/null +++ b/scripts/MiniMaxAlgo/player.py @@ -0,0 +1,38 @@ +import math +import random + + +class Player: + def __init__(self, letter): + self.letter = letter + + def get_move(self, game): + pass + + +class HumanPlayer(Player): + def __init__(self, letter): + super().__init__(letter) + + def get_move(self, game): + valid_square = False + val = None + while not valid_square: + square = input(self.letter + '\'s turn. Input move (0-9): ') + try: + val = int(square) + if val not in game.available_moves(): + raise ValueError + valid_square = True + except ValueError: + print('Invalid square. Try again.') + return val + + +class RandomComputerPlayer(Player): + def __init__(self, letter): + super().__init__(letter) + + def get_move(self, game): + square = random.choice(game.available_moves()) + return square From fae51028b1f4f3b1b528a4e515f3b24b63873134 Mon Sep 17 00:00:00 2001 From: P Gautam <92343715+PGautam27@users.noreply.github.com> Date: Fri, 7 Oct 2022 19:09:56 +0530 Subject: [PATCH 3/6] Added miniMax --- scripts/MiniMaxAlgo/player.py | 43 +++++++++++++++++++++++++++++++++++ 1 file changed, 43 insertions(+) diff --git a/scripts/MiniMaxAlgo/player.py b/scripts/MiniMaxAlgo/player.py index 2ffe8cc..34e997c 100644 --- a/scripts/MiniMaxAlgo/player.py +++ b/scripts/MiniMaxAlgo/player.py @@ -36,3 +36,46 @@ class RandomComputerPlayer(Player): def get_move(self, game): square = random.choice(game.available_moves()) return square + +class SmartComputerPlayer(Player): + def __init__(self, letter): + super().__init__(letter) + + def get_move(self, game): + if len(game.available_moves()) == 9: + square = random.choice(game.available_moves()) + else: + square = self.minimax(game, self.letter)['position'] + return square + + def minimax(self, state, player): + max_player = self.letter # yourself + other_player = 'O' if player == 'X' else 'X' + + # first we want to check if the previous move is a winner + if state.current_winner == other_player: + return {'position': None, 'score': 1 * (state.num_empty_squares() + 1) if other_player == max_player else -1 * ( + state.num_empty_squares() + 1)} + elif not state.empty_squares(): + return {'position': None, 'score': 0} + + if player == max_player: + best = {'position': None, 'score': -math.inf} # each score should maximize + else: + best = {'position': None, 'score': math.inf} # each score should minimize + for possible_move in state.available_moves(): + state.make_move(possible_move, player) + sim_score = self.minimax(state, other_player) # simulate a game after making that move + + # undo move + state.board[possible_move] = ' ' + state.current_winner = None + sim_score['position'] = possible_move # this represents the move optimal next move + + if player == max_player: # X is max player + if sim_score['score'] > best['score']: + best = sim_score + else: + if sim_score['score'] < best['score']: + best = sim_score + return best From 18c9ccc1c5762af84ae0211eb1fd082f228358c6 Mon Sep 17 00:00:00 2001 From: P Gautam <92343715+PGautam27@users.noreply.github.com> Date: Fri, 7 Oct 2022 19:10:47 +0530 Subject: [PATCH 4/6] Uses SmartComputer --- scripts/MiniMaxAlgo/TicTacToe.py | 2 +- 1 file changed, 1 insertion(+), 1 deletion(-) diff --git a/scripts/MiniMaxAlgo/TicTacToe.py b/scripts/MiniMaxAlgo/TicTacToe.py index 5e9545a..271eb3a 100644 --- a/scripts/MiniMaxAlgo/TicTacToe.py +++ b/scripts/MiniMaxAlgo/TicTacToe.py @@ -1,6 +1,6 @@ import math import time -from player import HumanPlayer, RandomComputerPlayer +from player import HumanPlayer, SmartComputerPlayer class TicTacToe(): From d4dbbd9ed59115a26aa044723e293c9a60dc460b Mon Sep 17 00:00:00 2001 From: P Gautam <92343715+PGautam27@users.noreply.github.com> Date: Fri, 7 Oct 2022 19:11:28 +0530 Subject: [PATCH 5/6] Removed random ai --- scripts/MiniMaxAlgo/player.py | 9 --------- 1 file changed, 9 deletions(-) diff --git a/scripts/MiniMaxAlgo/player.py b/scripts/MiniMaxAlgo/player.py index 34e997c..30cbea5 100644 --- a/scripts/MiniMaxAlgo/player.py +++ b/scripts/MiniMaxAlgo/player.py @@ -27,15 +27,6 @@ class HumanPlayer(Player): except ValueError: print('Invalid square. Try again.') return val - - -class RandomComputerPlayer(Player): - def __init__(self, letter): - super().__init__(letter) - - def get_move(self, game): - square = random.choice(game.available_moves()) - return square class SmartComputerPlayer(Player): def __init__(self, letter): From 5736b3fce22f0402cf18b924546a13f8aae5b1cd Mon Sep 17 00:00:00 2001 From: P Gautam <92343715+PGautam27@users.noreply.github.com> Date: Fri, 7 Oct 2022 19:15:44 +0530 Subject: [PATCH 6/6] Added Readme.md --- scripts/MiniMaxAlgo/README.md | 5 +++++ 1 file changed, 5 insertions(+) create mode 100644 scripts/MiniMaxAlgo/README.md diff --git a/scripts/MiniMaxAlgo/README.md b/scripts/MiniMaxAlgo/README.md new file mode 100644 index 0000000..68e40db --- /dev/null +++ b/scripts/MiniMaxAlgo/README.md @@ -0,0 +1,5 @@ +## MiniMax Algorithm + +It's implemented in such way that the AI minimizes it's loss and maximizes it's winning chances. + +![minimax](https://user-images.githubusercontent.com/92343715/194568346-bc6c78c3-fe22-43b9-ba25-e2f429b1b5e8.png)