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 fir
st, second, and third rows of lengths a, b, and c, respectively, where c le
ss than or equal to k, but a and b are arbitrary. (C) 2001 Academic Press.