favoredponcho@lemmy.zip to Programmer Humor@programming.dev · 13 days agoAlgorithms course PTSDlemmy.zipexternal-linkmessage-square25fedilinkarrow-up1584arrow-down16
arrow-up1578arrow-down1external-linkAlgorithms course PTSDlemmy.zipfavoredponcho@lemmy.zip to Programmer Humor@programming.dev · 13 days agomessage-square25fedilink
minus-squareSiethron@lemmy.worldlinkfedilinkarrow-up5·12 days agoWell the children don’t have to move one piece at a time, they just take all the rings off then put them on in the right order. So the optimal moves for a child is 4.
Well the children don’t have to move one piece at a time, they just take all the rings off then put them on in the right order. So the optimal moves for a child is 4.