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
  • 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. 
    1 Citations

    Figures and Topics from this paper

    Explore Further: Topics Discussed in This Paper

    Algorithmic and Logical Thinking Development : base of programming skills
    • ANNA HŮLKOVÁ
    • 2013
    • 9
    • PDF

    References

    SHOWING 1-10 OF 18 REFERENCES
    A logic programming model of the game of sprouts
    • 1
    A new analysis technique for the Sprouts Game
    • 2
    • PDF
    A modular approach to Sprouts
    • 4
    • PDF
    The Game of Sprouts.
    • 5
    • PDF
    Winning Ways for Your Mathematical Plays
    • 1,593
    • PDF
    Combinatorial Games: selected Bibliography with a Succinct Gourmet Introduction
    • 90
    • PDF
    Graph Theory and the Game of Sprouts
    • 9
    • PDF
    A Graph Drawing Algorithm for the Game of Sprouts
    • 2
    • PDF
    A furthe r computer analysis of Sprouts
    • 2007