[论文解读] Nearly Optimal Minimax Tree Search?

Arie de Bruin, Wim Pijls+2 more|arXiv (Cornell University)|Jan 1, 1994

Artificial Intelligence in Games参考文献 20被引用 7

一句话总结

本文挑战了游戏AI中对最小搜索图的传统理解，表明标准的最左最小图定义低估了优化潜力。通过重新定义最小图以包含置换最大化和子树大小感知剪枝，作者证明增强型Alpha-Beta搜索可实现远小于以往认为的搜索树规模，揭示当前程序的效率低于普遍预期。

ABSTRACT

Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth minimax tree-search algorithm traversing a uniform tree must explore, the so-called minimal tree. Since real-life minimax trees are not uniform, the exact size of this tree is not known for most applications. Further, most games have transpositions, implying that there exists a minimal graph which is smaller than the minimal tree. For three games (chess, Othello and checkers) we compute the size of the minimal tree and the minimal graph. Empirical evidence shows that in all three games, enhanced Alpha-Beta search is capable of building a tree that is close in size to that of the minimal graph. Hence, it appears game-playing programs build nearly optimal search trees. However, the conventional definition of the minimal graph is wrong. There are ways in which the size of the minimal graph can be reduced: by maximizing the number of transpositions in the search, and generating cutoffs using branches that lead to smaller search trees. The conventional definition of the minimal graph is just a left-most approximation. Calculating the size of the real minimal graph is too computationally intensive. However, upper bound approximations show it to be significantly smaller than the left-most minimal graph. Hence, it appears that game-playing programs are not searching as efficiently as is widely believed. Understanding the left-most and real minimal search graphs leads to some new ideas for enhancing Alpha-Beta search. One of them, enhanced transposition cutoffs, is shown to significantly reduce search tree size.

研究动机与目标

• 重新评估非均匀游戏树中极小化极大搜索树规模的理论下界。
• 识别传统最小图定义中的缺陷，该定义假设为最左结构，忽略了置换和子树大小的影响。
• 量化当前游戏程序实际搜索树规模与真正最小图规模之间的差距。
• 提出新方法——特别是增强型置换剪枝——以在现有实践基础上进一步减小搜索树规模。
• 证明由于置换和剪枝策略的次优使用，现有游戏程序的效率远低于普遍认知。

提出的方法

• 计算三种真实游戏（国际象棋、黑白棋、跳棋）中最小树和最小图的规模。
• 通过增强型Alpha-Beta搜索的实证分析，将实际树规模与理论最小边界进行比较。
• 重新定义最小图，纳入置换最大化和基于子树大小的剪枝，超越最左近似。
• 推导真实最小图规模的上界近似值，以估计理论上的改进潜力。
• 引入并评估增强型置换剪枝，优先选择通向更小搜索子树的分支。
• 分析这些新型剪枝策略在实践中对整体搜索树规模的缩减影响。

实验结果

研究问题

• RQ1 在国际象棋、黑白棋和跳棋等真实游戏中，最小树的规模与最小图的规模相比如何？
• RQ2 为何传统最左最小图定义不足以捕捉搜索工作量的真实下界？
• RQ3 置换重用和基于子树大小的剪枝能在多大程度上减小最小图的规模？
• RQ4 增强型Alpha-Beta搜索的实际性能与理论最小图规模在实践中相比如何？
• RQ5 新型剪枝策略（如增强型置换剪枝）是否能显著减小搜索树规模，超越当前方法？

主要发现

• 传统最小图（定义为最左结构）并非真正的最小图，且低估了优化潜力。
• 由于更优地利用置换和基于子树大小的剪枝，真实最小图可显著小于最左最小图。
• 实证结果表明，增强型Alpha-Beta搜索构建的树规模接近最小图，表明其接近最优——但仅在错误的传统定义下成立。
• 上界近似表明，真实最小图远小于最左版本，意味着当前程序的效率低于普遍认知。
• 增强型置换剪枝（优先选择通向更小子树的分支）被证明能显著减小搜索树规模。
• 本研究揭示，由于次优地利用置换和剪枝顺序，游戏程序的搜索效率远低于普遍假设。