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.
Code Challenge
Easton Parker
Dylan Watson
Do your own homework
Adrian Young
require 'hanoi_solver'
HanoiSolver.solve(ARGV)
Joseph Ross
Do your own homework, jamal
Benjamin Brown
just make the AI do it lmao
Caleb Robinson
>use tail recursion in c++
>clang optimizes it away
>submit assembly
wow that was hard
Josiah Diaz
while not solved:
move random disk to random peg
Colton Campbell
Go back to Vietnam and solve your own goddamn towers you commie
Alexander Turner
>iOS filename
fuck off
Jaxson Brown
The trick is to use a stack
Justin Murphy
ezpz
#!/usr/bin/python
from PIL import Image
hanoi = Image.open('1549334993918.gif')
solution = hanoi.transpose(Image.FLIP_LEFT_RIGHT)
solution.save('solved.gif')
Dylan James
>there will be exactly 5 disks on it
so close
Blake Watson
My solver is generalized and works for any number of disks
Bentley Nelson
top kek
Evan Walker
> 2^n - 1 steps
> paltry 5 disks
nigger just hardcode that shit
Brody Kelly
int main(void)
{
int n, x;
printf( "How many disks? " );
scanf( "%d", &n );
puts( "\n\n" );
for (x=1; x < (1
Tyler Cooper
Tyler Fisher
Hanoi with tail rec. Wanna see that.
Hunter Peterson
>recursivity is not allowed
you cant use the easiest, most efficient, and most maintainable solution because... uhhhhh... i said so
no thanks, ill just get a job somewhere that isnt run by retards
Lucas Gray
here is
Michael Gray
Use stack, negro
Isaiah Bennett
Interesting, gonna test that.
Ryder Lopez
hanoitower.mkolar.org
web.archive.org
Note that the generalized one doesn't use recursion.