Namespaces
Variants
Actions

Difference between revisions of "User:Joachim Draeger/sandbox"

From Encyclopedia of Mathematics
Jump to: navigation, search
Line 1: Line 1:
 
{{MSC|91A05}}  
 
{{MSC|91A05}}  
 
{{TEX|done}}
 
{{TEX|done}}
−
===References===
+
==References==
 +
 
 +
 
 
{|
 
{|
 +
|-
 +
|valign="top"|{{Ref|AJS}}||valign="top"| D. Applegate, G. Jacobson, and D. Sleator, [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.32.9472 " Computer analysis of Sprouts"], Carnegie Mellon University Computer Science Technical Report No. CMU-CS-91-144, May 1991
 +
|-
 +
|valign="top"|{{Ref|BS}}||valign="top"| L. Baird III, D. Schweitzer, [http://www.usafa.edu/df/dfe/dfer/centers/accr/docs/baird2010b.pdf "Complexity of the Game of Sprouts"], FCS'10 (6th International Conference on Foundations of Computer Science), Las Vegas 2010
 +
|-
 +
|valign="top"|{{Ref|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"|{{Ref|CC}}||valign="top"| G. Cairns, K. Chartarrayawadee, "Brussels Sprouts and Cloves", Mathematics Magazine 80(2007) February pp.46-58
 +
|-
 +
|valign="top"|{{Ref|C}}||valign="top"| M. Copper, [http://compmath.files.wordpress.com/2008/08/graph_theory_and_the_game_of_sprouts.pdf "Graph theory and the game of Sprouts"], American Mathematical Monthly 100(1993)478-482
 +
|-
 +
|valign="top"|{{Ref|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"|{{Ref|FL1}}||valign="top"| R. Focardi, F. Luccio, [http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.21.212 "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
 +
|-
 +
|valign="top"|{{Ref|FL2}}||valign="top"| R. Focardi, F. Luccio, [http://dx.doi.org/10.1016/j.dam.2003.11.008 "A modular approach to Sprouts"], Discrete Applied Mathematics 144 (2004)303-319
 +
|-
 +
|valign="top"|{{Ref|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"|{{Ref|G2}}||valign="top"| M. Gardner, "Sprouts and Brussels Sprouts", in M. Gardener, "Mathematical Carnival", Mathematical Association of America 1989
 +
|-
 +
|valign="top"|{{Ref|Gi}}||valign="top"| P.J. Giblin, Graphs, surfaces and homology, Second edition, Chapman \& Hall, London, 1981.
 +
|-
 +
|valign="top"|{{Ref|J}}||valign="top"| Josh Jordan
 +
|-
 +
|valign="top"|{{Ref|L}}||valign="top"| T.K. Lam, [http://compmath.files.wordpress.com/2008/08/connected_sprouts.doc "Connected sprouts"], American Mathematical Monthly 104(1997) February 116-119
 +
|-
 +
|valign="top"|{{Ref|LV1}}||valign="top"| J. Lemoine, S. Viennot, [http://download.tuxfamily.org/sprouts/sprouts-lemoine-viennot-070407.pdf "A further computer analysis of sprouts"], draft, 2007
 +
|-
 +
|valign="top"|{{Ref|LV2}}||valign="top"| J. Lemoine, S. Viennot, [http://arxiv.org/pdf/0812.0081v2 "Sprouts games on compact surfaces"], arXiv:0812.0081v2 [math.CO] 2 Mar 2009
 +
|-
 +
|valign="top"|{{Ref|LV3}}||valign="top"| J. Lemoine, S. Viennot, [http://arxiv.org/pdf/0908.4407v1 "Analysis of misere Sprouts game with reduced canonical trees"], arXiv:0908.4407v1 [math.CO] 30 Aug 2009
 +
|-
 +
|valign="top"|{{Ref|LV4}}||valign="top"| J. Lemoine, S. Viennot, [http://arxiv.org/abs/1008.2320 "Computer analysis of Sprouts with nimbers"], arXiv:1008.2320v1 [math.CO] 13 Aug 2010
 +
|-
 +
|valign="top"|{{Ref|LV5}}||valign="top"| J. Lemoine, S. Viennot, [http://arxiv.org/abs/1011.5841 "Nimbers are inevitable"], arXiv:1011.5841v1 [math.CO] 26 Nov 2010
 +
|-
 +
|valign="top"|{{Ref|Pl}}||valign="top"| T. Plambeck, [http://arxiv.org/abs/math/0603027 "Advances in Losing"], arXiv:math/0603027v1 [math.CO] 1 Mar 2006
 +
|-
 +
|valign="top"|{{Ref|Pr}}||valign="top"| G. Pritchett, "The game of Sprouts", Two-Year College Mathematics Journal 7(1976) December 21-25
 
|-
 
|-
 
|}
 
|}

Revision as of 18:15, 11 November 2012

2020 Mathematics Subject Classification: Primary: 91A05 [MSN][ZBL]

References

[AJS] 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
[BS] L. Baird III, D. Schweitzer, "Complexity of the Game of Sprouts", FCS'10 (6th International Conference on Foundations of Computer Science), Las Vegas 2010
[BCG] E. Berkelamp, J. Conway, R. Guy, "Winning Ways for your Mathematical Plays", vol. 2, Academic Press, London, 1982, chapter 17, pp. 564-568
[CC] G. Cairns, K. Chartarrayawadee, "Brussels Sprouts and Cloves", Mathematics Magazine 80(2007) February pp.46-58
[C] M. Copper, "Graph theory and the game of Sprouts", American Mathematical Monthly 100(1993)478-482
[DHKR] J. Draeger, S. Hahndel, G. Koestler, P. Rosmanith, "Sprouts: Formalisierung eines topologischen Spiels", Technical Report TUM-I9015, Technische Universität München 1990
[FL1] 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
[FL2] R. Focardi, F. Luccio, "A modular approach to Sprouts", Discrete Applied Mathematics 144 (2004)303-319
[G1] M. Gardner, "Mathematical games: of sprouts and brussels sprouts, games with a topological flavor", Scientific American 217(1967), July 112-115
[G2] M. Gardner, "Sprouts and Brussels Sprouts", in M. Gardener, "Mathematical Carnival", Mathematical Association of America 1989
[Gi] P.J. Giblin, Graphs, surfaces and homology, Second edition, Chapman \& Hall, London, 1981.
[J] Josh Jordan
[L] T.K. Lam, "Connected sprouts", American Mathematical Monthly 104(1997) February 116-119
[LV1] J. Lemoine, S. Viennot, "A further computer analysis of sprouts", draft, 2007
[LV2] J. Lemoine, S. Viennot, "Sprouts games on compact surfaces", arXiv:0812.0081v2 [math.CO] 2 Mar 2009
[LV3] J. Lemoine, S. Viennot, "Analysis of misere Sprouts game with reduced canonical trees", arXiv:0908.4407v1 [math.CO] 30 Aug 2009
[LV4] J. Lemoine, S. Viennot, "Computer analysis of Sprouts with nimbers", arXiv:1008.2320v1 [math.CO] 13 Aug 2010
[LV5] J. Lemoine, S. Viennot, "Nimbers are inevitable", arXiv:1011.5841v1 [math.CO] 26 Nov 2010
[Pl] T. Plambeck, "Advances in Losing", arXiv:math/0603027v1 [math.CO] 1 Mar 2006
[Pr] G. Pritchett, "The game of Sprouts", Two-Year College Mathematics Journal 7(1976) December 21-25
How to Cite This Entry:
Joachim Draeger/sandbox. Encyclopedia of Mathematics. URL: http://encyclopediaofmath.org/index.php?title=Joachim_Draeger/sandbox&oldid=28727
Retrieved from "https://encyclopediaofmath.org/index.php?title=User:Joachim_Draeger/sandbox&oldid=28728"