Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

Re^3: Hanoi Challenge

by thor (Priest)
on Oct 22, 2004 at 20:16 UTC ( #401669=note: print w/replies, xml ) Need Help??


in reply to Re^2: Hanoi Challenge
in thread Hanoi Challenge

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 -> 4
In the case of n disks and n+1 pegs, the last disk moves only once.

thor

Feel the white light, the light within
Be your own disciple, fan the sparks of will
For all of us waiting, your kingdom will come

Log In?
Username:
Password:

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://401669]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others scrutinizing the Monastery: (3)
As of 2021-12-01 08:44 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    No recent polls found

    Notices?