christos

u/christos@lemmy.world
134 posts · 256 comments

Recent posts

Recent comments

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.

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.

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.

on Audacity Nord theme · c/linux · 7 pts · 1y

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