|
|||||||||
|
|||||||||
|
|||||||||
| |
|||
 |
|
|
|
| |||||||||
 |
|
|
«
Previous Thread
|
Next Thread
»
|
Thread Tools | Search this Thread | Display Modes |
Dev Articles Community Forums Sponsor:
|
|
|
|
#1
July 1st, 2004, 11:20 PM
|
|||
|
|||
|
Tower's of Hanoi
Anyone tackled the Tower's of Hanoi.... Just thought I would bring back some memories for all those who have written pages and pages...... Your so proud of your program...... only to find an 8 line recursive solution.......
|
|
#3
July 2nd, 2004, 06:29 AM
|
|||
|
|||
|
Towers of hanoi is a programming assignment often used to introduce the concept of recursion. Imagine you have 3 poles in a line in front of you and around the left one is a number of disks, as you go down the stack each one gets larger. Your goal is to move them from this pole to the right hand one moving only one at a time and never placing a larger disk on top of a smaller disk.
Having said all that I don't think I've ever actually implemented the solution, maybe something to do next time I get a little bored. -KM-
|
|
| Viewing: Dev Articles Community Forums > Programming > C/C++ Help > Tower's of Hanoi |
| Thread Tools | Search this Thread |
| Display Modes | Rate This Thread |
|
|
 |
|
|
Del.icio.us
Digg
Google
Spurl
Blink
Furl
Simpy
Y! MyWeb
Linear Mode
