Assertion: puzzle's solution | /r/HasProperty | proposed by andreas hinz
Facets:
Source sentences:
text: A solution was proposed by Andreas Hinz, and is based on the observation that in a shortest sequence of moves, the largest disk that needs to be moved (obviously one may ignore all of the largest disks that will occupy the same peg in both the initial and final configurations) will move either exactly once or exactly twice.