The Tower of Hanoi problem consists of moving a tower of 64 disks, each smaller than the one below it, originally existing on one peg, to a second peg, using a third ...

The Tower of Hanoi puzzle is exactly the type of artificial, laboratory-based task that my Naturalistic Decision Making (NDM) community has avoided. There is no expertise. No context, no uncertainty.

We devise a simple visual method to determine whether a Tower of Hanoi configuration is a part of the optimal puzzle solution. The proof, sketched here, uses both mathematical induction and counting ...