Algorithms for interactive Sprouts

DOI10.1016/J.TCS.2016.06.032zbMATH Open1371.91028DBLPjournals/tcs/Browne16OpenAlexW2468052202WikidataQ62047003 ScholiaQ62047003MaRDI QIDQ307772FDOQ307772

Authors Cameron J. Browne 

Publication date 5 September 2016

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2016.06.032

zbMATH Keywords

combinatorial gameboundary matchingCDTSprouts

Mathematics Subject Classification ID

Games involving graphs (91A43) Combinatorial games (91A46)

Recommendations

• A modular approach to Sprouts
• Connected Sprouts
• Computer analysis of Sprouts with nimbers
• Playing simple loony dots-and-boxes endgames optimally
• Graph Theory and the Game of Sprouts

Cites work

• A modular approach to Sprouts
• Computational Geometry in C
• Computer analysis of Sprouts with nimbers
• Winning ways for your mathematical plays. Vol. 1.

Cited in

(3)

• Computer analysis of Sprouts with nimbers
• A modular approach to Sprouts
• Implementation of Sprouts: a graph drawing game

This page was built for publication: Algorithms for interactive Sprouts

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q307772)