多最小层多智能体pacman的极大极小算法实现问题

Question

以下是多智能体pacman的minimax算法的代码片段，其中有多个幽灵(最小玩家)。

def min_max(self, gamestate, current_depth, min_count):
    if current_depth == 1:
         return (self.evaluationFunction(gamestate),None)
# if max node
    if min_count == 0:
        min_count = gamestate.getNumAgents() - 1
        legal_actions = gamestate.getLegalActions(0)
        max_list = []
        for action in legal_actions:
            max_list.append((self.min_max(gamestate.generateSuccessor(0, action), current_depth - 1, min_count), action))
        return max(max_list, key = itemgetter(0))
# if min nodes...
    else:
        legal_actions = gamestate.getLegalActions(min_count)
        min_list = []
        for action in legal_actions:
            min_list.append((self.min_max(gamestate.generateSuccessor(min_count, action),current_depth - 1, min_count - 1), action))
            print(current_depth,min_count)
        return min(min_list, key = itemgetter(0))

pacman_move = self.min_max(gameState, self.depth * (no_of_ghosts + 1) + 1, 0)[1]

但是我得到了以下错误: ValueError: min() arg是一个空序列。

任何帮助我们都将不胜感激

Answer 1

你在min-step没有任何合法的动作--这就是为什么min_list是空的。

>>> min([])
Traceback (most recent call last):
  File "<stdin>", line 1, in <module>
ValueError: min() arg is an empty sequence

因此，处理以下情况：

if not legal_actions:
    # pass? win? lose?

在做min()之前