pastermil@sh.itjust.works to Programmer Humor@programming.dev · 2 months agoThat Nim Flashbackssh.itjust.worksimagemessage-square6fedilinkarrow-up14arrow-down10
arrow-up14arrow-down1imageThat Nim Flashbackssh.itjust.workspastermil@sh.itjust.works to Programmer Humor@programming.dev · 2 months agomessage-square6fedilink
minus-squarelad@programming.devlinkfedilinkEnglisharrow-up0·2 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-up1·2 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.
minus-squarelad@programming.devlinkfedilinkEnglisharrow-up1·2 months agoAnd that makes It good enough for an exam
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