in reply to Re: Recursion: the Towers of Hanoi problem
in thread Recursion: The Towers of Hanoi problem

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-
(so many nodes and so little time ... )

  • Comment on Re^2: Recursion: the Towers of Hanoi problem

Replies are listed 'Best First'.
Re^3: Recursion: the Towers of Hanoi problem
by apotheon (Deacon) on Oct 19, 2004 at 18:35 UTC
    Ah! Thank you.

    I'd seen this puzzle before (perhaps even in a CompSci course, and/or in a book about programming), but frankly didn't recall its conditions. I needed a memory refresher.

    - apotheon
    CopyWrite Chad Perrin
[reply]

In Section Tutorials