|© 1994, John Horton Conway|
|Used in maths research|
|n holes per row|
Sowing was invented by the English mathematician John Horton Conway who described the game in 1994 at an international workshop on combinatorial game theory hosted by the Mathematical Sciences Research Institute (MSRI) in Berkeley, California. The game is a single-lap, one rank mancala game.
Any board size and number of seeds can be used. A 1x24 board with three seeds initially in each pot might be a good size if played by humans.
|Suggested initial position|
Left plays from left to right, while Right plays from right to left.
The contents of a pot can only be distributed, if there are enough pots for each seed in the direction of play and if the last seed goes into a non-empty pot.
The last player who is able to make a legal move wins.
Variant: The first player who has no legal move wins ("misère-sowing").
The players try to create board positions which permits them to move while their opponent cant. The player with the larger reserve of moves will eventually win the game.
- Erickson, J.
- Sowing Games. In: Nowakowski, R. J. (Ed.). Games of No Chance (Mathematical Sciences Research Institute Publications 29). Cambridge University Press, Cambridge (England) 1996, 287-297.
- Guy, R. K.
- Unsolved Problems in Combinatorial Games. In: Nowakowski, R. J. (Ed.). Games of No Chance (Mathematical Sciences Research Institute Publications 29). Cambridge University Press, Cambridge (England) 1996, 486.
We publish it as we understand it is a fair use. Although the information posted in this web is under the Creative Commons Attribution ShareAlike 2.5 License this does not imply the game has lost its copyright. You can consider the game and its rules have a copyright, and what is free is this way of explaining them.
If you are the copyright holder and don't want to have it published here, please contact us