favoredponcho@lemmy.zip to Programmer Humor@programming.dev · 4 days agoAlgorithms course PTSDlemmy.zipexternal-linkmessage-square23linkfedilinkarrow-up11
arrow-up11external-linkAlgorithms course PTSDlemmy.zipfavoredponcho@lemmy.zip to Programmer Humor@programming.dev · 4 days agomessage-square23linkfedilink
minus-squareunmagical@lemmy.mllinkfedilinkarrow-up0·4 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-up0·4 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.