pastermil@sh.itjust.works to Programmer Humor · 7 months agoThat Nim Flashbackssh.itjust.worksimagemessage-square56fedilinkarrow-up1831arrow-down18
arrow-up1823arrow-down1imageThat Nim Flashbackssh.itjust.workspastermil@sh.itjust.works to Programmer Humor · 7 months agomessage-square56fedilink
minus-squareladlinkfedilinkEnglisharrow-up12·7 months ago Hanoi […] practice problems. Like you come to the exam and there’s a 64 piece Tower of Hanoi you need to solve manually to pass the exam
minus-squareJohnEdwa@sopuli.xyzlinkfedilinkarrow-up3·7 months agoAssuming 1 second per swap, a 64 disk tower of hanoi would take 585 billion years to solve - it has 2^64 -1 swaps.
Like you come to the exam and there’s a 64 piece Tower of Hanoi you need to solve manually to pass the exam
Assuming 1 second per swap, a 64 disk tower of hanoi would take 585 billion years to solve - it has 2^64 -1 swaps.
And that makes It good enough for an exam
Calm down, satan