Description: Tower of Hanoi problem solving recursive call. Problem Description: There are three columns A, B, C, A pillar with small to large order of the number of plates (plate number entered by the user). With the B-pillar requires all moved to C column the plate, you can only carry a plate, plate must always remain small to large emissions order. Requirement results show the process of moving plates.
To Search:
File list (Check if you may need any files):
hannuota\Debug\hannuota.pch
........\.....\vc60.idb
........\.....\vc60.pdb
........\.....\汉诺塔.exe
........\.....\汉诺塔.ilk
........\.....\汉诺塔.pch
........\.....\汉诺塔.pdb
........\hannuota.cpp
........\hannuota.dsp
........\hannuota.dsw
........\hannuota.ncb
........\hannuota.opt
........\hannuota.plg
........\汉诺塔.dsp
........\汉诺塔.dsw
........\汉诺塔.ncb
........\汉诺塔.opt
........\汉诺塔.plg
........\Debug
hannuota
Download