Tower of Hanoi
Three pegs and a stack of discs: move one at a time, never a larger disc onto a smaller one. Getting the whole stack to the right peg takes exactly 2ⁿ−1 moves. There is a hint button, and undo — though overdoing it still means admitting you are a bot.
Loading…
Failed to load
Something went wrong fetching resources. You can retry.
