favoredponcho@lemmy.zip to Programmer Humor@programming.dev · 27 days agoAlgorithms course PTSDmessage-squaremessage-square25fedilinkarrow-up1581
arrow-up1581message-squareAlgorithms course PTSDfavoredponcho@lemmy.zip to Programmer Humor@programming.dev · 27 days agomessage-square25fedilink
minus-squareunmagical@lemmy.mllinkfedilinkarrow-up2·26 days agoYou’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?
minus-squareSpaceNoodle@lemmy.worldlinkfedilinkarrow-up3·26 days agoFor 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.
You’re right, how can we simplify that into a usable insite?
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.