10 Mar
2016
10 Mar
'16
10:12 a.m.
Am I the only one who is dissatisfied with the solution to Problem 327 in the Playground feature of the February 2016 issue of "Math Horizons" (see http://digital.ipcprintservices.com/article/The_Playground/2387298/289441/ar... , page 31)? To show that a certain cube-grabbing game always ends in 65 moves, the authors first show that an obvious way to play the game ends in 65 moves, and then show that "the algorithm for removing the maximum number of cubes at each steps takes 65 steps". But I don't see why it follows that EVERY way to play the game ends in 65 moves. Question #1: Am I right to be dissatisfied? Question #2 (assuming that the answer to Question #1 is "Yes"): Can someone provide a proof that will satisfy me? Jim Propp