I have just updated the script, now up to 13 disks available (optimal moves: 8191).

It will take a while to solve it…

Same here

I don’t know, it is not often that I use exp in writing, however:

$ echo $((2**9-1))

Yup, this is fat finger mathematics. The correct number is 511, somehow zero got in the way.

The minimum number of moves required to solve a Tower of Hanoi puzzle is 2**n − 1, where n is the number of disks. 1023 for 10 disks, 5011 for 9 disks (updated max disks in the game). Recursion to the max.

UPDATE: Added Levels feature.

UPDATE: Added Levels feature.

I guess you are right, in a dark terminal, a mouse from time to time, and no windows whatsoever…

What do you mean? Who?

Heh, round corner characters for box drawing were there all along.

This game is named sausage as a tribute to BlackAdder S03E02: Ink and Incapability:

Renowned writer and lexicographer Dr. Samuel Johnson starts to read a tiny scrap of paper containing Baldrick’s miniscule novel:

Once upon a time, there was a lovely little sausage called…

…only to realize that after 18 years of arduous work, he failed to include the word SAUSAGE in his magnum opus.