Code Challenge

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.

Attached: 9AAF1A8D-4CF6-4840-93EC-813C800AA551.gif (404x125, 3K)

Other urls found in this thread:

hanoitower.mkolar.org/algo.html
web.archive.org/web/20040605074124/http://yupana.autonoma.edu.co/publicaciones/yupana/003/hanoi/hanoi_eng.html
twitter.com/SFWRedditImages

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