在minmax算法中,如何确定函数何时到达树的末尾并中断递归调用。python中的min max算法
我已经做了最大功能,在其中我打电话min功能。在min函数中,我做了什么?对于最大功能,我只是返回最佳分数。
def maxAgent(gameState, depth):
if (gameState.isWin()):
return gameState.getScore()
actions = gameState.getLegalActions(0);
bestScore = -99999
bestAction = Directions.STOP
for action in actions:
if (action != Directions.STOP):
score = minAgent(gameState.generateSuccessor(0, action), depth, 1)
if (score > bestScore):
bestScore = score
bestAction = action
return bestScore
def minvalue(gameState,depth,agentIndex):
if (gameState.isLose()):
return gameState.getScore()
else:
finalstage = False
number = gameState.getNumAgents()
if (agentIndex == number-1):
finalstage = True
bestScore = 9999
for action in gameState.getLegalActions(agentIndex):
if(action != Directions.STOP
我不明白现在该怎么办?我不允许设置树的深度限制。它必须是任意的。
您可能想要显示一些实际的代码。 – Amber 2010-07-31 20:06:17
你应该分享你迄今为止所拥有的。 – 2010-07-31 20:06:27
你可以看到我的代码 – Shilpa 2010-07-31 20:17:47