560
you are viewing a single comment's thread
view the rest of the comments
[-] SpaceNoodle@lemmy.world 4 points 1 day ago* (last edited 1 day 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 2 points 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 3 points 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.

this post was submitted on 01 Jun 2026
560 points (99.0% liked)

Programmer Humor

31634 readers
1100 users here now

Welcome to Programmer Humor!

This is a place where you can post jokes, memes, humor, etc. related to programming!

For sharing awful code theres also Programming Horror.

Rules

founded 3 years ago
MODERATORS