|
|
|
| Come for the quick hacks, stay for the epiphanies. | |
| PerlMonks |
Re^3: Hanoi Challengeby thor (Priest) |
| on Oct 22, 2004 at 20:16 UTC ( [id://401669]=note: print w/replies, xml ) | Need Help?? |
|
Example 2: Where there are three rings and four pegs, each ring only moves twice.Does it? If we're trying to get ring C to peg 4 A -> 1 B -> 2 C -> 4 B -> 4 A -> 4In the case of n disks and n+1 pegs, the last disk moves only once. thor
Feel the white light, the light within
In Section
Meditations
|
|
||||||||||||||||||||||