eryn/wave-ttt
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

Get the children sorting figured out

Browse source
This commit is contained in:
Eryn Wells 2017-09-30 13:56:00 -07:00
parent a29e9bd8cf
commit 878d8f479c
1 changed files with 4 additions and 8 deletions
Download patch file Download diff file Expand all files Collapse all files

12
tictactoe.py
View file

@ -33,7 +33,7 @@ class Board:
@property @property
def full(self): def full(self):
return self.num_x + self.num_o == BOARD_SIZE return self.num_x + self.num_o == BOARD_SIZE
@property @property
def is_o_turn(self): def is_o_turn(self):
x_ahead_one = (self.num_x == self.num_o + 1) x_ahead_one = (self.num_x == self.num_o + 1)
@ -82,7 +82,7 @@ class Board:
result = __check(diag) result = __check(diag)
if result: if result:
return result return result
return None return None
@property @property
@ -96,9 +96,6 @@ class Board:
Minimax algorithm, implemented recursively, to evaluate board state and Minimax algorithm, implemented recursively, to evaluate board state and
make a move. make a move.
''' '''
if self.score:
return self.score
score = None score = None
winner = self.winner winner = self.winner
if winner == Board.O: if winner == Board.O:
@ -110,7 +107,7 @@ class Board:
else: else:
minmax = max if self.is_o_turn else min minmax = max if self.is_o_turn else min
score = minmax([c.evaluate() for c in self.children]) score = minmax([c.evaluate() for c in self.children])
self._children.sort(key=lambda b: b.score, reverse=self.is_o_turn) self._children.sort(key=lambda b: b.score, reverse=True)
self.score = score self.score = score
return self.score return self.score
@ -125,8 +122,7 @@ class Board:
yield Board(b) yield Board(b)
def move(self): def move(self):
for c in self.children: self.evaluate()
c.evaluate()
try: try:
return self.children[0] return self.children[0]
except IndexError: except IndexError: