Towers of Hanoi
Rearranging – how many moves does it take?
Five disks stacked on a pole, arranged from largest to smallest. These five disks need to be moved to one of the other two poles, one disk at a time. So that, at every step, a smaller disk is always on top of a larger one.
Mathematically, this can be done in 31 moves. How many (or rather, how few) will you need to do it?
thema-Links
dokument-Links
more to browse