Corpus ID: 6882930

Sprouts game on compact surfaces

@article{Lemoine2008SproutsGO,
  title={Sprouts game on compact surfaces},
  author={J. Lemoine and Simon Viennot},
  journal={arXiv: Combinatorics},
  year={2008}
}
  • J. Lemoine, Simon Viennot
  • Published 2008
  • Mathematics
  • arXiv: Combinatorics
  • Sprouts is a two-player topological game, invented in 1967 by Michael Paterson and John Conway. The game starts with p spots drawn on a sheet of paper, and lasts at most 3p-1 moves: the player who makes the last move wins. Sprouts is a very intricate game and the best known manual analysis only achieved to find a winning strategy up to p=7 spots. Recent computer analysis reached up to p=32. The standard game is played on a plane, or equivalently on a sphere. In this article, we generalize and… CONTINUE READING

    References

    Publications referenced by this paper.
    SHOWING 1-8 OF 8 REFERENCES
    Computer analysis of Sprouts
    14
    Conway's ZIP Proof
    54
    Winning Ways for Your Mathematical Plays
    1525
    A further computer analysis of sprouts
    • 2007
    A further computer analysis of sprouts, http://download.tuxfamily.org/sprouts/sprouts-lemoine-viennot-070407.pdf
    • 2007
    Francis and Jeffrey R . Weeks , Conway ’ s zip proof
    • 1991
    Mathematical games: of sprouts and brussels sprouts; games with a topological flavor
    11
    Weeks , Conway ’ s zip proof