python中alpha_python中的Alphabeta剪枝

我正在尝试在一个连接四型游戏中实现一个计算机播放器。Alpha-beta修剪似乎是实现这一目标的最佳方法，但我似乎不知道我做错了什么。在

下面是我想出的代码。它从初始根状态开始。对于每一个可能的、有效的移动(如果没有修剪发生的话)，算法：对状态进行深度复制，更新状态(增加深度、切换圈数、添加片段、设置启发式值)，并将此新状态添加到根的后续项列表中。在

如果新状态不是叶(即在最大深度)，它递归地继续。如果它是一个叶，算法会检查根的值和适当的局部alpha/beta值，并相应地更新。在检查了所有可能的有效选项后，算法返回相应的本地alpha/beta值。在

至少，这是我想要的。每次运行都返回值0。此处请求的是初始化代码：class GameState:

def __init__(self, parentState = None):

# copy constructor

if not(parentState == None):

self.matrix = copy.deepcopy(parentState.matrix)

self.successor = copy.deepcopy(parentState.successor)

self.depth = parentState.depth

self.turn = parentState.turn

self.alpha = parentState.alpha

self.beta = parentState.beta

self.connects = copy.deepcopy(parentState.connects)

self.value = parentState.value

self.algo_value = parentState.value

self.solution = parentState.solution

# new instance

else:

# empty board

self.matrix = [[0 for y in xrange(6)] for x in xrange(7)]

## USED WHEN GROWING TREE

self.successor = [] # empty list

self.depth = 0 # start at root

self.turn = 1 # game starts on user's turn

## USED WHEN SEARCHING FOR SOLUTION

self.alpha = float("-inf")

self.beta = float("+inf")

self.connects = [0, 0, 0] # connects in state

self.algo_value = float("-inf")

self.value = 0 # alpha-beta value of connects

self.solution = False # connect four

def alphabeta(root):

if root.depth < MAX_EXPANSION_DEPTH:

# pass down alpha/beta

alpha = root.alpha

beta = root.beta

# for each possible move

for x in range(7):

# ALPHA-BETA PRUNING

# if root is MAXIMIZER

if (root.turn == 2) and (root.algo_value > beta): print "beta prune"

# if root is MINIMIZER

elif (root.turn == 1) and (root.algo_value < alpha): print "alpha prune"

# CANNOT prune

else:

# if move legal

if (checkMove(root, x)):

# CREATE NEW STATE

root.successor.append(GameState(root))

working_state = root.successor[-1]

# update state

working_state.successor = []

working_state.depth += 1

working_state.turn = (working_state.turn % 2) + 1

cons = dropPiece(working_state, x, working_state.turn)

# update state values

# MAXIMIZER

if working_state.turn == 2:

working_state.value = ((cons[0]*TWO_VAL)+(cons[1]*THREE_VAL)+(cons[2]*FOUR_VAL)) + root.value

working_state.algo_value = float("-inf")

# MINIMIZER

else:

working_state.value = ((-1)*((cons[0]*TWO_VAL)+(cons[1]*THREE_VAL)+(cons[2]*FOUR_VAL))) + root.value

working_state.algo_value = float("inf")

# if NOT a leaf node

if (working_state.depth < MAX_EXPANSION_DEPTH):

# update alpha/beta values

working_state.alpha = alpha

working_state.beta = beta

ret = alphabeta(working_state)

# if MAXIMIZER

if (root.turn == 2):

if (ret > root.algo_value): root.algo_value = ret

if (ret > alpha): alpha = ret

# if MINIMIZER

else:

if (ret < root.algo_value): root.algo_value = ret

if (ret < beta): beta = ret

# if leaf, return value

else:

if root.turn == 2:

if (working_state.value > root.algo_value): root.algo_value = working_state.value

if working_state.value > alpha: alpha = working_state.value

else:

if (working_state.value < root.algo_value): root.algo_value = working_state.value

if working_state.value < beta: beta = working_state.value

if root.turn == 2: return alpha

else: return beta