(When giving the number of disks remember that the total moves for the solution are 2^(number of disks)-1. And you will have to press as many Enters as the moves.)
Saturday, June 14, 2008
Hanoi Towers Solver
I just made a small program that solves, step by step, the Hanoi Towers puzzle for any number of disks. I though it's worth uploading it, so here it is. As always, it's a console application with nice (for my taste) ASCII graphics. It runs on both Linux and Windows as it is written in Lua. I included two Lua interpreters (for both OSes). To run it just drag and drop the .lua file on the interpreter. (after unzipping everything, of course).
Here is screenshot:
(When giving the number of disks remember that the total moves for the solution are 2^(number of disks)-1. And you will have to press as many Enters as the moves.)
(When giving the number of disks remember that the total moves for the solution are 2^(number of disks)-1. And you will have to press as many Enters as the moves.)
Subscribe to:
Post Comments (Atom)
Popular Posts
-
The QWERTY keyboard layout (the one that you probably use every day) was made mainly to avoid stuck pairs of typebars in typewriters . Of c... -
I finally finished rewriting AskWise and it think it's time to take it out of beta. It is a menu driver console application that using... -
Don't read this article. I've written a much better one which you can find here . The purpose of this (late-night) post is to sho...
2^(number of disks)- 1
ReplyDeletenomizw oti einai
Sosta. To diorthosa. ;-)
ReplyDelete