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

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

1995-02-09

arxiv.org/abs/math/9502225v1

Mathematics

Combinatorics

Scientific paper

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

Affiliated with

Also associated with

No associations

Rating

The combinatorics of Mancala-type games: Ayo, Tchoukaitlon, and 1/pi does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with The combinatorics of Mancala-type games: Ayo, Tchoukaitlon, and 1/pi, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The combinatorics of Mancala-type games: Ayo, Tchoukaitlon, and 1/pi will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-390993