Take your recursion skills to the next level. If you've got a recurrence relation but no computer, how can you find a closed form? What about asymptotic behavior? How fast do rabbits reproduce?
If someone passes through all 10 stages, what is the final score?
1) Only one disk at the top of a stack can be moved at a time.
2) No disk can be placed on top of a smaller disk.
What is the minimum number of steps required to move a tower of 7 disks?
Details and assumptions
Assume that the flask is large enough to contain any number of bacteria.