python alpha beta_Python AlphaBeta Purning for Minimax极大

我想为3-Men's Morris游戏实现一个代理，它非常类似于tic-tac-toe游戏-我想使用Minimax策略和Alpha-Beta修剪，这是我在Python中基于StackOverflow上的this post和{a3}的代码，但是它不起作用！！它给出了一个错误的解决方案，即使当前状态的继承者之一是解决方案def alpha_beta(state,alpha,beta,turn,depth):

if int(terminal_test(state,turn)) == int(MY_NUMBER):

return 1 #win

elif (int(terminal_test(state,turn))!=0) and (int(terminal_test(state,turn))!=int(MY_NUMBER)) :

return -1 #loose

else:

if int(depth) == 13:

return 0 #reached limit

moves = successors(state,turn,int(depth))

#valid moves for player based on rules

for move in moves:

state = make_move(state,move,turn)

current_eval = -alpha_beta(state, -beta, -alpha, 2-int(turn),int(depth)+1)

state = undo_move(state,move,turn)

if current_eval >= beta:

return beta

if current_eval > alpha:

alpha = current_eval

return alpha

def rootAlphaBeta(state,depth, turn):

best_move = None

max_eval = float('-infinity')

moves = successors(state,turn,int(depth))

alpha = float('infinity')

for move in moves:

state = make_move(state,move,turn)

alpha = -alpha_beta(state, float('-infinity'), alpha, 2-int(turn),int(depth)+1)

state = undo_move(state,move,turn)

if alpha > max_eval:

max_eval = alpha

best_move = move

#best_move which is selected here is not really the best move!

return best_move