My question is whether or not cycles can occur in the abstract game, Clearcut.
A few smart guys (and me) have been trying to either find a cycle or prove that one can't happen. Ten days have passed without success. Super hard problem.
Clearcut was designed by me. The only benefit I will derive from a proof is to be able to say with certainty that Clearcut is finite.