arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1803.00874cs.AI
收藏

国际象棋中特定棋子集总搜索空间大小的估计

Estimating Total Search Space Size for Specific Piece Sets in Chess

Universiti Tenaga Nasional(马来西亚国家能源大学)

Azlan Iqbal

摘要:

自动国际象棋问题或拼图组合通常涉及生成和测试各种不同的位置,有时使用特定的棋子集。一旦一个位置已经产生,它通常是基于游戏规则的位置合法性测试。然而,能够估计用于特定片段组合的搜索空间大小开始是有用的。因此,如果一个理想的国际象棋问题是通过在大约1000亿的理论搜索空间中检查“仅仅”100,000个位置而成功产生的,这将意味着所使用的组合方法是非常可行的,甚至可能令人印象深刻。在这篇文章中,我解释了一种使用组合学和排列方法计算这个搜索空间大小的方法。虽然数学本身可能已经建立,但据我们所知,将其应用于棋盘和棋子的精确方法和理由尚未记录在案。此外,该方法可以用作进一步估计搜索空间大小的有用的起点,该搜索空间大小根据自动作曲者如何被允许在棋盘上放置棋子(因为这影响其总搜索空间大小)来过滤出合法性和旋转的位置。

英文摘要:

Automatic chess problem or puzzle composition typically involves generating and testing various different positions, sometimes using particular piece sets. Once a position has been generated, it is then usually tested for positional legality based on the game rules. However, it is useful to be able to estimate what the search space size for particular piece combinations is to begin with. So if a desirable chess problem was successfully generated by examining 'merely' 100,000 or so positions in a theoretical search space of about 100 billion, this would imply the composing approach used was quite viable and perhaps even impressive. In this article, I explain a method of calculating the size of this search space using a combinatorics and permutations approach. While the mathematics itself may already be established, a precise method and justification of applying it with regard to the chessboard and chess pieces has not been documented, to the best of our knowledge. Additionally, the method could serve as a useful starting point for further estimations of search space size which filter out positions for legality and rotation, depending on how the automatic composer is allowed to place pieces on the board (because this affects its total search space size).

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

↑