Three-rowed CHOMP. A “meta” (pseudo-) algorithm is described that, for any fixed k, finds a fast (O(log(a))) algorithm for playing 3-rowed Chomp, starting with the first, second, and third rows of lengths a, b, and c, respectively, where c≤k, but a and b are arbitrary. The Maple package Chomp3Rows is available from Zeilberger’s website, http://www.math.temple.edu/ zeilberg/.
Keywords for this software
References in zbMATH (referenced in 8 articles , 1 standard article )
Showing results 1 to 8 of 8.
- Nakamura, Shunsuke; Miyadera, Ryohei: Impartial chocolate bar games (2015)
- Ganzell, Sandy; Meadows, Alex; Ross, John: Twist untangle and related knot games (2014)
- Fraenkel, Aviezri S.: Aperiodic subtraction games (2011)
- Soltys, Michael; Wilson, Craig: On the complexity of computing winning strategies for finite poset games (2011)
- Friedman, Eric J.; Landsberg, Adam S.: On the geometry of combinatorial games: a renormalization approach (2009)
- Friedman, Eric J.; Landsberg, Adam Scott: Scaling, renormalization, and universality in combinatorial games: The geometry of Chomp (2007)
- Ito, Hiro; Nakamura, Gisaku; Takata, Satoshi: Winning ways of weighted poset games (2007)
- Zeilberger, Doron: Three-rowed CHOMP (2001)