GeezerVison is showing github.com — ClassicComputerScienceProblemsInPython/Chapter8/tictactoe.py at master · serosgb/ClassicComputerScienceProblemsInPython

Expand file tree

tictactoe.py

Copy path

More file actions

Latest commit

History

83 lines (71 loc) · 3.28 KB

tictactoe.py

Copy path

File metadata and controls

83 lines (71 loc) · 3.28 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

# tictactoe.py

# From Classic Computer Science Problems in Python Chapter 8

# Licensed under the Apache License, Version 2.0 (the "License");

# you may not use this file except in compliance with the License.

# You may obtain a copy of the License at

# http://www.apache.org/licenses/LICENSE-2.0

# Unless required by applicable law or agreed to in writing, software

# distributed under the License is distributed on an "AS IS" BASIS,

# WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.

# See the License for the specific language governing permissions and

# limitations under the License.

from __future__ import annotations

from typing import List

from enum import Enum

from board import Piece, Board, Move

class TTTPiece(Piece, Enum):

X = "X"

O = "O"

E = " " # stand-in for empty

@property

def opposite(self) -> TTTPiece:

if self == TTTPiece.X:

return TTTPiece.O

elif self == TTTPiece.O:

return TTTPiece.X

else:

return TTTPiece.E

def __str__(self) -> str:

return self.value

class TTTBoard(Board):

def __init__(self, position: List[TTTPiece] = [TTTPiece.E] * 9, turn: TTTPiece = TTTPiece.X) -> None:

self.position: List[TTTPiece] = position

self._turn: TTTPiece = turn

@property

def turn(self) -> Piece:

return self._turn

def move(self, location: Move) -> Board:

temp_position: List[TTTPiece] = self.position.copy()

temp_position[location] = self._turn

return TTTBoard(temp_position, self._turn.opposite)

@property

def legal_moves(self) -> List[Move]:

return [Move(l) for l in range(len(self.position)) if self.position[l] == TTTPiece.E]

@property

def is_win(self) -> bool:

# three row, three column, and then two diagonal checks

return self.position[0] == self.position[1] and self.position[0] == self.position[2] and self.position[0] != TTTPiece.E or \

self.position[3] == self.position[4] and self.position[3] == self.position[5] and self.position[3] != TTTPiece.E or \

self.position[6] == self.position[7] and self.position[6] == self.position[8] and self.position[6] != TTTPiece.E or \

self.position[0] == self.position[3] and self.position[0] == self.position[6] and self.position[0] != TTTPiece.E or \

self.position[1] == self.position[4] and self.position[1] == self.position[7] and self.position[1] != TTTPiece.E or \

self.position[2] == self.position[5] and self.position[2] == self.position[8] and self.position[2] != TTTPiece.E or \

self.position[0] == self.position[4] and self.position[0] == self.position[8] and self.position[0] != TTTPiece.E or \

self.position[2] == self.position[4] and self.position[2] == self.position[6] and self.position[2] != TTTPiece.E

def evaluate(self, player: Piece) -> float:

if self.is_win and self.turn == player:

return -1

elif self.is_win and self.turn != player:

return 1

else:

return 0

def __repr__(self) -> str:

return f"""{self.position[0]}|{self.position[1]}|{self.position[2]}

-----

{self.position[3]}|{self.position[4]}|{self.position[5]}

-----

{self.position[6]}|{self.position[7]}|{self.position[8]}"""