Revival, I guess.
Three different coins, called 1, 2, and 3, are placed on a table in an arbitrary order.
The rules of this game are: you can only stack lower-numbered coins onto higher-numbered coins, and you can only move coins over by one space (for example, an order 3 1 2, you cannot move the 2 onto the 3.)
You could also think of this as a version of the Tower of Hanoi.
Find the minimum number of moves required to move these following orders into the sequence 1 2 3, and if you cannot get to 1 2 3 using these rules, answer with "Cannot do".
3 2 1
2 1 3
1 3 2
(For all participants: Yes, this is the 5th