Description: Tower of Hanoi is formed according to a legend a problem: There are three poles A, B, C. A rod with N (N> 1) perforated disc, the disc size in order from the bottom to smaller. Requirements according to the following rules will move all disks C Rod: You can only move one disc market can not be stacked in small cap top.
To Search:
File list (Check if you may need any files):
3_hanoi\hanoi-stack.cpp
.......\hanoi01.cpp
.......\useStack.cpp
3_hanoi
Download