• unmagical@lemmy.ml
    link
    fedilink
    arrow-up
    2
    ·
    1 day 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
      ·
      1 day 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.