The Sprouts winning-strategy congruence conjecture
In the Sprouts game, a two-player game beginning with spots in which the player making the last move wins, a player has a winning strategy for exactly one of the two players. Sprouts winning-strategy conjecture. The first player has a winning strategy if and only if is congruent to , , or modulo . This is the original pattern conjectured from computer analysis of the game; the paper studies its extension from the plane to compact surfaces, while the general status of the pattern is not resolved here.
References
- Julien Lemoine and Simon Viennot, “Sprouts game on compact surfaces”, arXiv:0812.0081 (2013).
Progress summary
Never refreshed
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.