On Three-rowed Chomp
Andries E. Brouwer, Gábor Horváth, Ildikó Molnár-Sáska, Szabó, Csaba · TU/e Research Portal · 2005
Chomp is a 50 year-old game played on a partially ordered set P. It has been in the center of interest of several mathematicians since then. Even when P is simply a 3 × n lattice, we have almost no information about the winning strategy. In this paper we present a new approach and a cubic algorithm for computing the winning positions for this case. We also prove that from the initial positions there are infinitely many winning moves in the third row.