Solitaire Mancala Games and the Chinese Remainder Theorem
From MaRDI portal
(Redirected from Publication:5404028)
Abstract: Mancala is a generic name for a family of sowing games that are popular all over the world. There are many two-player mancala games in which a player may move again if their move ends in their own store. In this work, we study a simple solitaire mancala game called Tchoukaillon that facilitates the analysis of "sweep" moves, in which all of the stones on a portion of the board can be collected into the store. We include a self-contained account of prior research on Tchoukaillon, as well as a new description of all winning Tchoukaillon boards with a given length. We also prove an analogue of the Chinese Remainder Theorem for Tchoukaillon boards, and give an algorithm to reconstruct a complete winning Tchoukaillon board from partial information. Finally, we propose a graph-theoretic generalization of Tchoukaillon for further study.
Recommendations
- The solitaire clobber game and correducibility
- The algorithmics of solitaire-like games
- Mathematical aspect of the combinatorial game ``Mahjong
- Solitaire Clobber on circulant graphs
- The solitaire clobber game and correducibility of graphs
- On a game of Sierpiński
- The Shortest Game of Chinese Checkers and Related Problems
- Peg solitaire game on Sierpinski graphs
- The Complexity of Solitaire
Cited in
(7)- Cup stacking in graphs
- An optimal bound on the number of moves for open mancala
- Fagan's Construction, Strange Roots, and Tchoukaillon Solitaire
- scientific article; zbMATH DE number 7302729 (Why is no real title available?)
- Periodical states and marching groups in a closed Owari
- Mu Torere: An Analysis of a Maori Game
- The solitaire clobber game and correducibility
This page was built for publication: Solitaire Mancala Games and the Chinese Remainder Theorem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5404028)