Can modified minimax win in Pearl's game?

作     者：Cai, Haoyang Ma, Haodong Li, Linyu Zhang, Luming 

作者机构：Hangzhou Foreign Languages Sch 12 Grade Hangzhou Zhejiang Peoples R China Zhengzhou Foreign Languages Sch 12 Grade Zhengzhou Henan Peoples R China Bishop Hendricken High Sch 12 Grade Warwick RI USA Zhejiang Univ Coll Comp Sci Hangzhou Zhejiang Peoples R China 

出 版 物：《JOURNAL OF VISUAL COMMUNICATION AND IMAGE REPRESENTATION》 (可视通信与图像显示杂志)

年 卷 期：2018年第57卷第Nov.期

页      面：23-27页

核心收录：

学科分类：0809[工学-电子科学与技术（可授工学、理学学位）] 08[工学] 0835[工学-软件工程] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Minimax algorithm Modified Minimax algorithm Pearl's game 

摘      要：Minimax algorithm 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.