Problem-Solving Strategies · Superchallenge problem

Ten coins lie in a row, all heads. A move chooses a head that is not the last coin, turns it to tails, and turns over the coin immediately to its right. What is the LARGEST possible number of moves before no move is possible?