Solitaire Mancala Games and the Chinese Remainder Theorem

From MaRDI portal
Publication:5404028

DOI10.4169/AMER.MATH.MONTHLY.120.08.706zbMATH Open1284.05169arXiv1112.3593OpenAlexW2963319719WikidataQ123653830 ScholiaQ123653830MaRDI QIDQ5404028FDOQ5404028


Authors: Laura Taalman, Anthony Tongen, Brant C. Jones Edit this on Wikidata


Publication date: 20 March 2014

Published in: The American Mathematical Monthly (Search for Journal in Brave)

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.


Full work available at URL: https://arxiv.org/abs/1112.3593




Recommendations





Cited In (7)





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)