A logic programming model of the game of sprouts
Abstract
The game of Sprouts has intrigued mathematicians for nearly twenty years. This paper describes a representation scheme which simplifies much of the geometry of the game. Using this representation, we develop a Prolog program which will play Sprouts. It is hoped that the program will prove to be a useful research tool in finding the key to a winning strategy for Sprouts and that the representation will serve as a useful model for studying planar graphs.
References
[1]
E.R. Berlekamp, J. H. Conway, and R. K. Guy, Winning Ways for your mathematical plays, Academic Press, New York 1982.
[2]
J.H. Briggs, LPA micro-PROLOG Professional User Guide, Logic Programming Associates Ltd, London 1985.
[3]
K.L. Clark and F.G. McCabe, micro-PROLOG: Programming in Logic, Prentice/Hall, Englewood Cliffs, New Jersey 1984.
[4]
Martin Gardner, Mathematical Games: Of sprouts and Brussels sprouts; games with a topological flavor, Sci. Amer. 217 l(July 1967) 112-115.
[5]
Gordon Pritchett, The game of Sprouts, Two-Year Coll. Math. J. 7 4(Dec. 1976) 21-25.
Index Terms
- A logic programming model of the game of sprouts
Recommendations
A logic programming model of the game of sprouts
SIGCSE '87: Proceedings of the eighteenth SIGCSE technical symposium on Computer science educationThe game of Sprouts has intrigued mathematicians for nearly twenty years. This paper describes a representation scheme which simplifies much of the geometry of the game. Using this representation, we develop a Prolog program which will play Sprouts. It ...
Implementation of Sprouts: A Graph Drawing Game
Graph Drawing and Network VisualizationAbstractSprouts is a two-player pencil-and-paper game invented by John Conway and Michael Paterson in 1967. In the game, the players take turns in joining dots by curves according to simple rules, until one player cannot make a move. The game of Sprouts ...
Comments
Information & Contributors
Information
Published In
Copyright © 1987 ACM.
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
Published: 01 February 1987
Published in SIGCSE Volume 19, Issue 1
Check for updates
Qualifiers
- Article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 429Total Downloads
- Downloads (Last 12 months)65
- Downloads (Last 6 weeks)9
Reflects downloads up to 03 Oct 2024
Other Metrics
Citations
View Options
Get Access
Login options
Check if you have access through your login credentials or your institution to get full access on this article.
Sign in