Chomp, Recurrences and Chaos(?)
暂无分享,去创建一个
In this article, dedicated with admiration and friendship to chaos and difference (and hence recurrence) equations guru Saber Elaydi, I give a new approach and a new algorithm for Chomp, David Gale's celebrated combinatorial game. This work is inspired by Xinyu Sun's “ultimate-periodicity” conjecture and by its brilliant proof by high-school student Steven Byrnes. The algorithm is implemented in a Maple package BYRNES accompanying this article. By looking at the output, and inspired by previous work of Andries Brouwer, I speculate that Chomp is chaotic, in a yet-to-be-made-precise sense, because the losing positions are given by “weird” recurrences. †http://www.math.rutgers.edu/∼zeilberg/. First version: June 3, 2003. This version: June 9, 2003. Accompanied by the Maple package BYRNES available from http://www.math.rutgers.edu/∼zeilberg/programs.html. Supported in part by the NSF.
[1] A. Fraenkel. Scenic Trails Ascending from Sea-Level Nim to Alpine Chess , 1995, math/9503222.
[2] E. Berlekamp,et al. Winning Ways for Your Mathematical Plays , 1983 .
[3] David Gale,et al. A Curious Nim-Type Game , 1974 .
[4] H. Waelbroeck,et al. Discrete Chaos , 1996, chao-dyn/9610005.
[5] S. Elaydi. An introduction to difference equations , 1995 .