A modular approach to Sprouts

DOI10.1016/J.DAM.2003.11.008zbMATH Open1098.91028OpenAlexW2023805908WikidataQ57832124 ScholiaQ57832124MaRDI QIDQ1765239FDOQ1765239

Authors: Riccardo Focardi, Flaminia L. Luccio 

Publication date: 23 February 2005

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2003.11.008

Recommendations

• Computer analysis of Sprouts with nimbers
• Graph Theory and the Game of Sprouts
• Connected Sprouts
• Algorithms for interactive Sprouts
• The Game of Cycles

zbMATH Keywords

algorithmsplanar graphsgames

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Games involving graphs (91A43)

Cites Work

• Parallel concepts in graph theory
• Title not available (Why is that?)
• Planar graphs: Theory and algorithms
• Title not available (Why is that?)
• Graph Theory and the Game of Sprouts
• Connected Sprouts

Cited In (7)

• Brussels sprouts and cloves
• Planted Brussels Sprouts (after Ji-Propp)
• On Conway’s Brussels Sprouts
• Algorithms for interactive Sprouts
• Implementation of Sprouts: a graph drawing game
• Morpion solitaire 5D: a new upper bound of 121 on the maximum score
• Computer analysis of Sprouts with nimbers

This page was built for publication: A modular approach to Sprouts

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