Decidability of Cup Problems and Computation of Solutions
Xu Zhao, Brian Knaeble · 2013 NCUR · 2013
An interesting problem in recreational mathematics is the three cups problem. It is a problem without a solution. There are infinitely many, related, n-choose-r cup problems. Each of these is shown to be decidable, through the construction of an explicit algorithm. The algorithm is able to compute solutions for solvable problems. The algorithm is run for 0 r n 10 and the results are discussed.