arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1609.04648cs.AI
收藏

排序国际象棋

Sequencing Chess

Université du Luxembourg(卢森堡大学);Deutsches Zentrum für Luft- und Raumfahrt (DLR)(德国航空航天中心);Heinrich-Heine-Universität Düsseldorf(海因里希·海涅杜塞尔多夫大学)

A. Atashpendar, T. Schilling, Th. Voigtmann

摘要:

通过转移路径抽样的蒙特卡罗模拟,分析了象棋的状态空间结构。基于将给定配置的棋子转置到另一个棋子所需的典型移动次数,我们得出结论,状态空间由几个口袋组成,这些口袋之间的转换是罕见的。熟练的玩家会探索更小的位置子集,这些位置只会非常稀疏地填充其中的一些口袋。这些结果表明,通常的措施来估计这两个,状态空间的大小和树的大小的法律行动,是不是唯一的指标的游戏的复杂性,但拓扑的考虑是同样重要的。

英文摘要:

We analyze the structure of the state space of chess by means of transition path sampling Monte Carlo simulation. Based on the typical number of moves required to transpose a given configuration of chess pieces into another, we conclude that the state space consists of several pockets between which transitions are rare. Skilled players explore an even smaller subset of positions that populate some of these pockets only very sparsely. These results suggest that the usual measures to estimate both, the size of the state space and the size of the tree of legal moves, are not unique indicators of the complexity of the game, but that topological considerations are equally important.

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

↑