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-squareSiethron@lemmy.worldlinkfedilinkarrow-up0·3 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.