• Soyweiser@awful.systems
    link
    fedilink
    English
    arrow-up
    3
    ·
    edit-2
    4 days ago

    Right, yeah i just recall that for a high enough bit of towers the amount of steps needed to solve it rises quickly. The story, “Now Inhale”, by Eric Frank Russell, uses 64 discs. Fun story.

    Min steps is 2 to the power the number of disks minus 1.

    Programming a system that solves it was a programming excersize for me a long time ago. Those are my stronger memories of it

    • YourNetworkIsHaunted@awful.systems
      link
      fedilink
      English
      arrow-up
      4
      ·
      4 days ago

      It’s a solid intro CS puzzle for teaching recursion. I think the original story they invented to go with it also had 64 disks in a temple in, well, Hanoi. Once the priests finished it the world was supposed to end or something.