We don't bite newbies here... much | |
PerlMonks |
Re^2: Recursion: the Towers of Hanoi problemby Theo (Priest) |
on Oct 19, 2004 at 15:00 UTC ( [id://400553]=note: print w/replies, xml ) | Need Help?? |
When all of the disks are on a different peg than they started on, size ordered smallest to largest, top to bottom. An extra "twist" is to require them to end up on a specific peg.
-Theo-
In Section
Tutorials
|
|