http://www.perlmonks.org?node_id=400388


in reply to Recursion: The Towers of Hanoi problem

Did I miss the part where you told us what the criteria are for "finishing" the puzzle?

- apotheon
CopyWrite Chad Perrin
  • Comment on Re: Recursion: the Towers of Hanoi problem

Replies are listed 'Best First'.
Re^2: Recursion: the Towers of Hanoi problem
by Theo (Priest) on Oct 19, 2004 at 15:00 UTC
    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 ... )

      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