torres de hanoi en dev c

This helps me learn and understand new stuff. The list of moves for a tower being carried from one peg onto another one, as produced by the recursive algorithm, has many regularities. With three disks, the puzzle can be solved in seven moves. This file contains additional information, probably added from the digital camera or scanner used to create or digitize it. Hacker's delight 1st ed.

37844 37845 37846 37847 37848