Here’s a challenge for you, Jow Forums.
Write a solver for Hanoi towers, knowing there will be exactly 5 disks on it.
PLOT TWIST (dun, dun, dun): Recursivity is not allowed.
Go.
Here’s a challenge for you, Jow Forums.
Write a solver for Hanoi towers, knowing there will be exactly 5 disks on it.
PLOT TWIST (dun, dun, dun): Recursivity is not allowed.
Go.
Do your own homework
require 'hanoi_solver'
HanoiSolver.solve(ARGV)
Do your own homework, jamal
just make the AI do it lmao
>use tail recursion in c++
>clang optimizes it away
>submit assembly
wow that was hard
while not solved:
move random disk to random peg
Go back to Vietnam and solve your own goddamn towers you commie
>iOS filename
fuck off
The trick is to use a stack