Arrange 10 coins into a triangle (as shown below) and then remove one coin of your choice. By jumping over other coins and then removing the jumped coin, what is the fewest number of moves needed to reduce the triangle to a single coin?
- A coin can only jump over a single adjacent coin into a space immediately after it.
- A continuous chain of jumps made by a single coin counts as 1 move.
- No sliding allowed.
Puzzle for submission: What is the minimum number of moves needed to leave just one coin remaining?