问题描述
嘿,我对递归有问题。我有一个minimax函数,看起来像这样:
def minimax(board,depth,isMaximizing):
print("Starting recursion no.")
print(depth)
if depth==0:
return heuristic()
result = checkOfWin()
if(result != None):
return scores[result]
if isMaximizing:
bestscore = -np.inf
for i in range(10):
for j in range(10):
if board[i][j] == 0:
board[i][j] = "B"
score = minimax(board,depth-1,False)
board[i][j] = 0
bestscore = max(score,bestscore)
return bestscore
else:
bestscore = np.inf
for i in range(10):
for j in range(10):
if board[i][j] == 0:
board[i][j] = "R"
score = minimax(board,True)
board[i][j] = 0
bestscore = min(score,bestscore)
return bestscore
minimax(board,5,p1.isMaxing)
启发式函数现在只是简单地返回随机值。问题在于,当深度达到0时,它会不断循环遍历。 控制台的输出看起来像这样:
Starting recursion no.
5
Starting recursion no.
4
Starting recursion no.
3
Starting recursion no.
2
Starting recursion no.
1
Starting recursion no.
0
Starting recursion no.
0
Starting recursion no.
0
Starting recursion no.
0
Starting recursion no.
0
Starting recursion no.
0
Starting recursion no.
0
Starting recursion no.
0
我该如何解决?看来它不想从递归中返回
解决方法
暂无找到可以解决该程序问题的有效方法,小编努力寻找整理中!
如果你已经找到好的解决方法,欢迎将解决方案带上本链接一起发送给小编。
小编邮箱:dio#foxmail.com (将#修改为@)