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.

This bug is now fixed, its origin was escape code parsing while using the arrow keys: looped three times before getting the input. You can update the script to get the improved version. As I said, it is now fixed, plus the max level of disks is up to 13.

Recursion until hell freezes over.

Rust away!🤭 Actually it sounds reasonable, I guess in Rust 2D arrays are easier to work with than in Bash.

I don't understand what you are asking, please elaborate.

You noticed correctly, I made the trade off because I wanted to have an extra disk level available (10 instead of 9), but I believe it was not worth it. I updated the script, it is now quite snappier I think, check it out if you wish, and let me know what you think.

Thanks for the feedback.

I think it depends on which version you install. I install it from my distro's software manager.