This program is to count the fewest step of Hanoi Problem for t Tower d Disk (t >= 3). But it has stack overflow problem when d and t become big(has been solved)
-
Notifications
You must be signed in to change notification settings - Fork 0
murasakisaya/HanoiTower
Folders and files
| Name | Name | Last commit message | Last commit date | |
|---|---|---|---|---|
Repository files navigation
About
This program is to count the lowest step of Hanoi Problem for t Tower d Disk
Topics
Resources
Stars
Watchers
Forks
Packages 0
No packages published