References
- M. H. Albert, R. J. Nowakowski, and D. Wolfe, Lessons in Play, An Introduction to Combinatorial Game Theory, A K Peters, Wellesley MA, 2007.
- N. Allasani, I. Juarez, N. Stack, and M. Styles, REU project, St. Mary's College of Maryland, St. Mary's City MD, Summer 2011.
- J. G. Baron, The game of nim—a heuristic approach, Math. Mag. 47 (1974) 23–28; available at http://dx.doi.org/10.2307/2688757.
- E. Berlekamp, J. H. Conway, and R. Guy, Winning Ways for Your Mathematical Plays, 2nd ed., vols. 1–4, A K Peters, Wellesley MA, 2001.
- E. Berlekamp, M. Mueller, R. Nowakowski, and D. Wolfe, Combinatorial game theory workshop: final report—Banff Canada 2005; available at http://www.birs.ca/workshops/2005/05w5048/report05w5048.pdf.
- C. L. Bouton, Nim, a game with a complete mathematical theory, Annals of Math., Second Series 3 (1901-1902) 35–39.
- A. E. Brouwer, G. Horáth, I. Molnár-Sáska, and C. Szabó, On three-rowed chomp, Integers 3 (2005).
- S. Byrnes, Poset game periodicity, Integers 3 (2003).
- J. D. Christensen and M. Tilford, Unsolved problems: David Gale's Subset Take-Away game, Amer. Math. Monthly 104 (1997) 762–766; available at http://dx.doi.org/10.2307/2975243.
- J. H. Conway, On Numbers and Games, 2nd ed., A K Peters, Wellesley MA, 2001.
- E. Friedman and A. Landsberg, Scaling, renormalization, and universality in combinatorial games: The geometry of Chomp, in Combinatorial Optimization and Applications, Springer, New York, 2007, 876–879.
- E. Friedman and A. Landsberg, On the geometry of combinatorial games: a renormalization approach, in Games of No Chance 3, Cambridge University Press, Cambridge, 2009, 349–376.
- D. Gale, A curious nim-type game, Amer. Math. Monthly 81 (1974) 876–879; available at http://dx.doi.org/10.2307/2319446.
- D. Gale, Mathematical entertainments, Mathematical Intelligencer 15 (1993) 56–60; available at http://dx.doi.org/10.1007/BF03024260.
- D. Gale and A. Neyman, Nim-type games, Internat. J. Game Theory 11 (1982) 17–20; available at http://dx.doi.org/10.1007/BF01771243.
- R. K. Guy, Unsolved problems in combinatorial games, in Games of No Chance, Cambridge University Press, Cambridge, 1996, 475–491.
- P. Halmos, Problems for Mathematicians Young and Old, Mathematical Association of America, Washington, DC, 1991.
- S. Huddleston and J. Shurman, Transfinite chomp, in More Games of No Chance, Cambridge University Press, Cambridge, 2002, 183–212.
- T. Khandhawit and L. Ye, Chomp on graphs and subsets (2011); available at http://arxiv.org/abs/1101.2718.
- F. Schuh, Spel van delers, Nieuw Tijdschrift voor Wiskunde 39 (1952) 299–304.
- D. Zeilberger, Three-rowed chomp, Adv. Applied Math. 26 (2001) 168–179; available at http://dx.doi.org/10.1006/aama.2000.0714.
- D. Zeilberger, Chomp, recurrences, and chaos, J. Difference Equations and its Applications 10 (2004) 1281–1293; available at http://dx.doi.org/10.1080/10236190410001652720.