545
Algorithms course PTSD (lemmy.zip)
submitted 5 months ago by to c/programmer_humor@programming.dev
25 comments fedilink hide all child comments
 
you are viewing a single comment's thread
view the rest of the comments
[–] 13 points 5 months ago (3 children)

Source tower has odd disks? Move top piece to destination tower. Otherwise, move it to the top of the off tower. Always move the largest disk you can that wasn't placed in your previous move.

  • permalink
  • fedilink
  • source
  • hideshow 3 child comments
    •
  • [–] 4 points 5 months ago* (2 children)

    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.

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 2 child comments
    •
  • [–] 2 points 5 months ago (1 child)

    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?

  • permalink
  • fedilink
  • source
  • parent
  • hideshow 1 child comment
    •