Mancala-type游戏的组合学：Ayo，Tchoukaitlon和1/pi
The combinatorics of Mancala-type games: Ayo, Tchoukaitlon, and 1/pi
摘要：
在尼日利亚的双人Mancala-type游戏Ayo中的某些残局考虑可以与在纸牌游戏Tchoukaitlon中找到获胜位置的问题相一致。确定了$s$采场凹坑出现的周期性。给定$n$坑，发现获胜位置中的石头的数量由$n^{2}/π$渐近地限定。
英文摘要：
Certain endgame considerations in the two-player Nigerian Mancala-type game Ayo can be identified with the problem of finding winning positions in the solitaire game Tchoukaitlon. The periodicity of the pit occupancies in $s$ stone winning positions is determined. Given $n$ pits, the number of stones in a winning position is found to be asymptotically bounded by $n^{2}/π$.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
