Three-Rowed CHOMP
2001; Elsevier BV; Volume: 26; Issue: 2 Linguagem: Inglês
10.1006/aama.2000.0714
ISSN1090-2074
Autores Tópico(s)Sports Analytics and Performance
ResumoA “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.
Referência(s)