• SpaceNoodle@lemmy.world
    link
    fedilink
    arrow-up
    4
    ·
    13 hours ago

    These instructions seem incomplete.

    Consider a tower of three, moving from the left to right:

    321 / - / -

    32 / - / 1

    3 / 2 / 1

    Next, 1 should be moved to the center position on top of two for the optimal solution, but your ruleset has no indicator of which choice should be made.

    • unmagical@lemmy.ml
      link
      fedilink
      arrow-up
      2
      ·
      12 hours ago

      You’re right, how can we simplify that into a usable insite?

      Prioritize erecting “neat” towers then moving the largest disk not placed in the previous step?

      • SpaceNoodle@lemmy.world
        link
        fedilink
        arrow-up
        3
        ·
        12 hours ago

        For each tower of size N, move tower (N - 1) to the non-target position, then move the base to the target position, then move the previously moved tower of size (N - 1) to the target position.