A little help with recursion.

[igotsnomoney]

I'm working on an assignment now, and I've been stuck on this for a while. The idea is to implement the frame-stewert algorithm to solve reeve's puzzle (tower of hanoi with 4 towers) 

 

my first attempt didn't work so well ( it would stop halfway) and I know something is really wrong. I tried searching the web for a pseudocode implementation to get an idea of what i'm supposed to be doing, but I didn't have any luck

 

if anyone could explain how the algorithm works, it would really be a lifesaver. i got to get this done in 1 day so i have 24 hours to debug and submit.

[lutzee]

I think this should be a good starting point http://rosettacode.org/wiki/Towers_of_Hanoi

[Ciccioo]

alright, i didn't really understand 100% how it works, but i think that it is just as "simple" as the wikipedia explaination makes it look

it's just a "take a big tower, and break it into small towers, until you have disks, and you know how to move a disk"

 

trying to understand it, i just took an implementation from http://stackoverflow.com/questions/3607161/towers-of-hanoi-with-k-pegs and made it run

if it can help, i uploaded it here http://chuk.altervista.org/areaProgetti/ciao.html

 

the thing that is driving me crazy is the "n-2" thing, for how i understood the algorithm it should work with a "n-1" too, but if i put a "n-1" there, everything goes bananas

[ultimatemythbuster]

The problem is that to understand recursion one must first understand recursion.

 

 

Sorry for not being constructive.