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, zeilberg/.