User:Joachim Draeger/sandbox

2020 Mathematics Subject Classification: Primary: 91A05 [MSN][ZBL] ===References==={||-|valign="top"|[AJS]||valign="top"| D. Applegate, G. Jacobson, and D. Sleator, "Computer analysis of Sprouts", Carnegie Mellon University Computer Science Technical Report No. CMU-CS-91-144, May 1991, http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.9472%7C-%7Cvalign="top"|[BS]||valign="top"| L. Baird III, D. Schweitzer, "Complexity of the Game of Sprouts", FCS'10 (6th International Conference on Foundations of Computer Science), Las Vegas 2010, http://www.usafa.edu/df/dfe/dfer/centers/accr/docs/baird2010b.pdf%7C-%7Cvalign="top"|[BCG]||valign="top"| E. Berkelamp, J. Conway, R. Guy, "Winning Ways for your Mathematical Plays", vol. 2, Academic Press, London, 1982, chapter 17, pp. 564-568|-|valign="top"|[CC]||valign="top"| G. Cairns, K. Chartarrayawadee, "Brussels Sprouts and Cloves", Mathematics Magazine 80(2007) February pp.46-58|-|valign="top"|[C]||valign="top"| M. Copper, "Graph theory and the game of Sprouts", American Mathematical Monthly 100(1993)478-482 http://compmath.files.wordpress.com/2008/08/graph\_theory\_and\_the\_game\_of\_sprouts.pdf%7C-%7Cvalign="top"|[DHKR]||valign="top"| J. Draeger, S. Hahndel, G. Koestler, P. Rosmanith, "Sprouts: Formalisierung eines topologischen Spiels", Technical Report TUM-I9015, Technische Universität München 1990|-|valign="top"|[FL1]||valign="top"| R. Focardi, F. Luccio, "A new analysis technique for the Sprouts Game", FUN 2001 (2nd Convegno International Conference on Fun with Algorithms), Isola d’Elba 2001, Ed. Carleton Scientific, pp. 117-132 http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.212%7C-%7Cvalign="top"|[FL2]||valign="top"| R. Focardi, F. Luccio, "A modular approach to Sprouts", Discrete Applied Mathematics 144 (2004)303-319 http://dx.doi.org/10.1016/j.dam.2003.11.008%7C-%7Cvalign="top"|[G1]||valign="top"| M. Gardner, "Mathematical games: of sprouts and brussels sprouts, games with a topological flavor", Scientific American 217(1967), July 112-115|-|valign="top"|[G2]||valign="top"| M. Gardner, "Sprouts and Brussels Sprouts", in M. Gardener, "Mathematical Carnival", Mathematical Association of America 1989 |-|valign="top"|[Gi]||valign="top"| P.J. Giblin, Graphs, surfaces and homology, Second edition, Chapman \& Hall, London, 1981.|-|valign="top"|[J]||valign="top"| Josh Jordan|-|valign="top"|[L]||valign="top"| T.K. Lam, "Connected sprouts", American Mathematical Monthly 104(1997) February 116-119, http://compmath.files.wordpress.com/2008/08/connected\_sprouts.doc |-|valign="top"|[LV1]||valign="top"| J. Lemoine, S. Viennot, "A further computer analysis of sprouts", 2007 http://download.tuxfamily.org/sprouts/sprouts-lemoine-viennot-070407.pdf%7C-%7Cvalign="top"|[LV2]||valign="top"| J. Lemoine, S. Viennot, "Sprouts games on compact surfaces", arXiv:0812.0081v2 [math.CO] 2 Mar 2009, http://arxiv.org/pdf/0812.0081v2%7C-%7Cvalign="top"|[LV3]||valign="top"| J. Lemoine, S. Viennot, "Analysis of misere Sprouts game with reduced canonical trees", arXiv:0908.4407v1 [math.CO] 30 Aug 2009, http://arxiv.org/pdf/0908.4407v1%7C-%7Cvalign="top"|[LV4]||valign="top"| J. Lemoine, S. Viennot, "Computer analysis of Sprouts with nimbers", arXiv:1008.2320v1 [math.CO] 13 Aug 2010, http://arxiv.org/abs/1008.2320 |-|valign="top"|[LV5]||valign="top"| J. Lemoine, S. Viennot, "Nimbers are inevitable", arXiv:1011.5841v1 [math.CO] 26 Nov 2010 http://arxiv.org/abs/1011.5841%7C-%7Cvalign="top"|[Pl]||valign="top"| T. Plambeck, "Advances in Losing", arXiv:math/0603027v1 [math.CO] 1 Mar 2006 http://arxiv.org/abs/math/0603027 |-|valign="top"|[Pr]||valign="top"| G. Pritchett, "The game of Sprouts", Two-Year College Mathematics Journal 7(1976) December 21-25|-|}