minimaxalgorithm is widely used for adversarial searching. It is commonly believed that searching depth and winning chance has a positive correlation, but Dana S. Nau pointed out in his 1982 research that in Pearl...
详细信息
minimaxalgorithm is widely used for adversarial searching. It is commonly believed that searching depth and winning chance has a positive correlation, but Dana S. Nau pointed out in his 1982 research that in Pearl's game, pathology occurs. minimax shows a decrease of winning chance as searching depth increases. Our research proposes a possible way to fix the pathology by taking the opponent's strategy into consideration in some specific cases. The experiment proves that the accumulation of incorrect predictions at least partially causes the pathology. Our modified version of minimax successfully overcomes the pathology and continues to present the power of minimax in Pearl's game. (C) 2018 Elsevier Inc. All rights reserved.
暂无评论