中国最大的python社区-python中的最小最大算法

在minmax算法中,如何确定函数何时到达树尾并中断递归调用.

我做了一个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

我现在不知道如何进行？不允许设置树的深度限制.它必须是任意的.