arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1112.2144cs.AIcs.ITmath.IT
收藏

计算机国际象棋决策的信息论分析

An Information Theoretic Analysis of Decision in Computer Chess

ETH Zurich(苏黎世联邦理工学院)

Alexandru Godescu

摘要:

本文提出的方法的基础是这样一种思想,即信息是战略决策中最重要的因素之一,包括计算机象棋和其他战略游戏中的决策。本文提出的模型和算法描述的思想的基础上的信息理论的决策策略游戏。该模型概括和提供了一个数学理由,最流行的搜索算法之一,在领先的计算机国际象棋程序,分数层计划。然而,尽管它在领先的计算机国际象棋应用程序中取得了成功,但到目前为止,很少有人发表关于这种方法的文章。本文在信息论的公理中为这种方法建立了一个基本基础,然后推导出搜索程序中使用的原则,并在数学上描述了系数的形式。分数铺层搜索的最重要的参数之一是从基本原理推导出来的。到目前为止,这个系数通常是手工制作的,或者是从直观的元素或数据采掘中确定的。有一个深刻的,信息理论的理由,这样一个参数。在某种程度上,所提出的方法是以前的方法的推广。更重要的是,它显示了为什么分数深度铺层计划是如此强大。这是因为算法沿着可能获得最高信息增益的路线导航。一个工作和原始的实现已经编写并测试了这个算法,并在附录中提供。这篇文章基本上是自成一体的,并提供了适当的背景知识和参考资料。这些假设是直观的,并且是在国际象棋伟大冠军所预期和直观描述的方向上。

英文摘要:

The basis of the method proposed in this article is the idea that information is one of the most important factors in strategic decisions, including decisions in computer chess and other strategy games. The model proposed in this article and the algorithm described are based on the idea of a information theoretic basis of decision in strategy games . The model generalizes and provides a mathematical justification for one of the most popular search algorithms used in leading computer chess programs, the fractional ply scheme. However, despite its success in leading computer chess applications, until now few has been published about this method. The article creates a fundamental basis for this method in the axioms of information theory, then derives the principles used in programming the search and describes mathematically the form of the coefficients. One of the most important parameters of the fractional ply search is derived from fundamental principles. Until now this coefficient has been usually handcrafted or determined from intuitive elements or data mining. There is a deep, information theoretical justification for such a parameter. In one way the method proposed is a generalization of previous methods. More important, it shows why the fractional depth ply scheme is so powerful. It is because the algorithm navigates along the lines where the highest information gain is possible. A working and original implementation has been written and tested for this algorithm and is provided in the appendix. The article is essentially self-contained and gives proper background knowledge and references. The assumptions are intuitive and in the direction expected and described intuitively by great champions of chess.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑