×

The combinatorics of Mancala-type games: Ayo, Tchoukaitlon, and 1/pi. arXiv:math/9502225

Preprint, arXiv:math/9502225 [math.CO] (1995).
Summary: 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}/\pi\).

MSC:

90D05 \(2\)-person games (MSC1991)
Full Text: arXiv
arXiv data are taken from the arXiv OAI-PMH API. If you found a mistake, please report it directly to arXiv.