Corpus ID: 4491857

Complexity of the Game of Sprouts

@inproceedings{Baird2010ComplexityOT,
  title={Complexity of the Game of Sprouts},
  author={L. Baird and D. Schweitzer},
  booktitle={FCS},
  year={2010}
}

L. Baird, D. Schweitzer

Published in FCS 2010

Computer Science

usafa.edu

Save to Library

Create Alert

Cite

Launch Research Feed

Sprouts is a simple, yet analytically interesting, game first developed in 1967 by Michael Paterson and John Conway. Mathematicians have analyzed the game for various strategies and mathematical properties. This paper adds to the body of knowledge by presenting a proof that several problems in the Game of Sprouts are NP-complete. In addition, for anyone wanting to conduct further research on the game, a complete annotated bibliography for Sprouts is listed.