IDI_Master/project_reversi
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity

Create a function to give moves

Browse source 
It's possible to randomize it now
This commit is contained in:
Yorick Barbanneau 2023-12-20 18:25:55 +01:00
parent 935d3b8f23
commit 6979749d5d
1 changed files with 21 additions and 11 deletions
Download patch file Download diff file Expand all files Collapse all files

32
src/classes/Engines.py
View file

@ -8,6 +8,7 @@ class PlayerEngine:
self.heuristic = heuristic
self.options = options
self.interrupt_search = False
self.randomize_moves = False
self.logger.info("Init engine {}, options:{}".format(
self.__class__.__name__,
self.options
@ -19,6 +20,12 @@ class PlayerEngine:
self.get_player_name(self.player)
))
def get_player_moves(self, board):
if self.randomize_moves is True:
return random.random(board.legal_moves())
else:
return board.legal_moves()
@staticmethod
def get_player_name(player):
return 'White (O)' if player == 2 else 'Black (X)'
@ -68,7 +75,7 @@ class MinmaxPlayerEngine(PlayerEngine):
nodes = 1
leafs = 0
move = []
for m in board.legal_moves():
for m in self.get_player_moves(board):
board.push(m)
v, n, l = self.checkMinMax(board, False, self.options['depth'] - 1)
if v > value:
@ -99,7 +106,7 @@ class MinmaxPlayerEngine(PlayerEngine):
if friend_move:
value = -math.inf
for m in board.legal_moves():
for m in self.get_player_moves(board):
board.push(m)
v, n, l = self.checkMinMax(board, False, depth - 1)
if v > value:
@ -110,7 +117,7 @@ class MinmaxPlayerEngine(PlayerEngine):
else:
value = math.inf
for m in board.legal_moves():
for m in self.get_player_moves(board):
board.push(m)
v, n, l = self.checkMinMax(board, True, depth - 1)
if v < value:
@ -130,8 +137,7 @@ class AlphabetaPlayerEngine(PlayerEngine):
nodes = 1
leafs = 0
move = []
all_moves = board.legal_moves()
for m in all_moves:
for m in self.get_player_moves(board):
board.push(m)
value, n, l = self.checkAlphaBeta(board, False, self.options['depth'] - 1, alpha, beta)
board.pop()
@ -161,8 +167,7 @@ class AlphabetaPlayerEngine(PlayerEngine):
return self.heuristic.get(board, self.player), nodes, leafs
if friend_move:
all_moves = board.legal_moves()
for m in all_moves:
for m in self.get_player_moves(board):
board.push(m)
v, n, l = self.checkAlphaBeta(board, False, depth - 1, alpha, beta)
board.pop()
@ -178,8 +183,7 @@ class AlphabetaPlayerEngine(PlayerEngine):
return alpha, nodes, leafs
else:
all_moves = board.legal_moves()
for m in all_moves:
for m in self.get_player_moves(board):
board.push(m)
v, n, l = self.checkAlphaBeta(board, True, depth - 1, alpha, beta)
board.pop();
@ -247,7 +251,7 @@ class MinmaxDeepeningPlayerEngine(MinmaxPlayerEngine):
class AlphaBetaDeepeningPlayerEngine(AlphabetaPlayerEngine):
def get_move(self, board):
super().get_move(board)
#super().get_move(board)
self.interrupt_search = False
# Get an alarm signal to stop iterations
@ -282,10 +286,16 @@ class AlphaBetaDeepeningPlayerEngine(AlphabetaPlayerEngine):
alpha
))
depth = depth + 1
self.logger.debug("id_alphabeta - depth reached: {} | max depth : {}".format(
self.logger.info("id_alphabeta - depth reached: {} | max depth : {}".format(
depth - 1,
max_depth
))
self.logger.info("Tree statistics:\n\tnodes:{}\n\tleafs:{}\n\theuristic:{}".format(
nodes,
leafs,
alpha
))
return move
def alarm_handler(self, signal, frame):