Minimax递归超时

问题描述

我正在尝试为pacman游戏编写minimax算法。我在递归上遇到问题-有时我的算法“正常运行”（它不会崩溃，但仍返回错误的值），然后有时会崩溃并给我递归错误，提示已超过最大递归深度。有人可以告诉我我在这里做错了什么吗？谢谢！

 def minimax(self,gamestate,depth,agent):
        if depth == self.depth or gamestate.isWin() or gamestate.isLose():
            return self.evaluationFunction(gamestate),Directions.STOP
        best_move = None

        if agent == 0: ## Pacman is max
            best_val = float('-inf')
        else: ## ghosties are min
            best_val = float('inf')

        actions = gamestate.getLegalActions(agent)
        for action in actions:
            next_agent = agent + 1  ## quit moving me! ## this goes here to set next_agent to be same as agent each iteration,because it also gets changed below
            successor = gamestate.generateSuccessor(agent,action) ## generate successors gamestate (ie new board)
            if next_agent == gamestate.getNumAgents():
                next_agent = 0  ## Once we reach the last agent,set back to 0
                depth += 1  ## increment depth

            v = self.minimax(successor,next_agent)

            ## here is where we set the max and min values based on the agent
            if agent == 0: ## pacman - max
                if v > best_val:
                    best_val = v
                    best_move = action
            else: ## ghost - min
                if v < best_val:
                    best_val = v
                    best_move = action
        return best_move,best_val

解决方法

暂无找到可以解决该程序问题的有效方法，小编努力寻找整理中！

如果你已经找到好的解决方法，欢迎将解决方案带上本链接一起发送给小编。

小编邮箱:dio#foxmail.com (将#修改为@）