christos
- 5 Posts
- 16 Comments
there is a simple
readafter the table, so no, it is drawn once. I trid to put a cursor on it, but felt unresponsive and lagging, thusread, kept simple
No worries, I am just trying to estimate how much I need to truncate the torrent names to be functional for the average user.
Just to give you an idea:

Thanks. The ideal should be 140 chars. I will work out truncating the torrent name column in order for everything to fit in 80 char terminals, although it would not be very functional.
I appreciate the time you dedicated to answer. I was hoping for a number as an answer to a simple question.
Thx, if many users respond with less than 140, I will need to find a solution involving truncating strings and using
tput cols
There are torrent variables that need to be shown in a row: category, date, name, size, uploader, seeders and leechers. This not plausiblel in 80x25, thus the question for fullscreen.
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.
christos@lemmy.worldOPto
Linux Gaming@lemmy.world•Terminal Tower of Hanoi, in BashEnglish
2·3 months agoI have just updated the script, now up to 13 disks available (optimal moves: 8191).
It will take a while to solve it…
christos@lemmy.worldOPto
Linux Gaming@lemmy.world•Terminal Tower of Hanoi, in BashEnglish
1·3 months agoSame here
christos@lemmy.worldOPto
Linux Gaming@lemmy.world•Terminal Tower of Hanoi, in BashEnglish
3·3 months agoI don’t know, it is not often that I use exp in writing, however:
$ echo $((2**9-1))
christos@lemmy.worldOPto
Linux Gaming@lemmy.world•Terminal Tower of Hanoi, in BashEnglish
8·3 months agoYup, this is fat finger mathematics. The correct number is 511, somehow zero got in the way.
christos@lemmy.worldOPto
Linux Gaming@lemmy.world•Terminal Tower of Hanoi, in BashEnglish
7·3 months agoThe 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.
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.


Please elaborate