International records / Internet Archive

The combinatorics of Mancala-type games: Ayo, Tchoukaitlon, and 1/pi

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$.

No file is held for this record yet. The catalogue entry and the link to where it was published are kept.

Source	Internet Archive
Collection	International records
Kind	Document
Publisher	Duane M. Broline; Daniel E. Loeb
Date	1995-02-09
Type	texts
Details	ia description
Found at	https://archive.org/details/arxiv-math9502225
Archived copy	Look it up in the Wayback Machine
Record ID	`internet-archive:arxiv-math9502225`

Cite this record

The combinatorics of Mancala-type games: Ayo, Tchoukaitlon, and 1/pi. Internet Archive, 1995. Vero Archive, record internet-archive:arxiv-math9502225.