QUICK NOTE: I do not recommend you to solve 10+ disks, since 10 already takes 15 min if you do it really fast, and it doubles for every disk added. I just gave the option because I can, and to show off the auto solver. This is a Towers of Hanoi game. A game where you need to move an entire stack of disks from one side to the other, with only 2 simple rules - A disk can only be placed on top of a larger disk - You may only move one disk at a time Easy huh? Try it out yourself! Choose an amount of disks, and click one of the buttons - Play! You play the game yourself. You must use the 1 2 and 3 keys to first select a disk from the stack of that number, counted from left to right (the highest disk of the stack) and then you use the 1 2 and 3 keys to move the selected disk to a new stack. - Solve it for me! Click this to auto solve the puzzle. I programmed an algorithm that can solve every puzzle, no matter how many disks. I didn't cheat, I've not made lists with moves to follow, I just made an algorithm to calculate it real-time. There are two settings you can input: - Speed: You can set a speed to the solving algorithm. this will delay the next movement so that you can follow the steps easier. (1: slow, 10: fast) -Turbo solving: This turns the 'speed' setting off completely and solves the puzzle as fast as possible. (0: off, 1: on) Running the game in turbo mode might even give the turbo solving an extra boost! Enjoy!
curated by @Really_A! Thanks! Omg it got top loved too! feel free to remix, but please change something. Please love and fave for the awesome self solving mode :D Music: Vexento - Let's Run Away solving algorithm completely made by me :D Towers are completely drawn with pen. Thanks @WO997 for your great tri filler!
