In the starting position, assume that the disks come in two alternating colours. Number the disks 1 to n, with n the largest disk. Assuming you move the disks optimally to solve the traditional puzzle, consider the states between moves as well as the initial and final states. What fraction of these states have does the disk k(k = 1 to (n-1)) rest on a disk of the same colour?