The combinatorics of Mancala-type games: Ayo, Tchoukaitlon, and 1/pi
Abstract
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 n2/π.
0
Turn this paper into a full lesson
ArcXiv compiles a staged curriculum from this paper: 8-12 lessons across beginner → advanced, synthesised section guides, visuals, flashcards, a quiz, exercises, and on-demand deep dives per section. Grounded in the abstract, never invented.