December 3, 2019
Problem of the Week
Tuesday, December 3, 2019
A mouse hides under one of five boxes. Call them A, B, C, D, and E. Each morning you try to trap him by lifting up one of the 5 boxes. The trouble is that this mouse knows in advance which box you will lift and he will do whatever he can to foil your plans. Each day he moves from the box he is under to a neighboring box and each morning you try once again to trap him. Can you give a sequence of six boxes that you will lift over six mornings that will guarantee that you will catch this mouse by the 6th morning?
