cross-posted from: https://lemmy.world/post/47988648
https://gitlab.com/christosangel/hanoi
Hanoi is a simple terminal version of the known classical game Tower of Hanoi, written in Bash.
During the game, the user can move left and right, pick disks and drop them in other stacks.
The aim is to move all the disks from the ORIGIN pile to the DESTINATION pile, in as little moves as possible
11 Comments
palordrolap@fedia.io · 7 pts · 81d
If I correctly remember the minimum number of moves required to get all the disks from one tower to another, 10 layers is going to be a slog.
christos@lemmy.world · 7 pts · 81d
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.
besmtt@lemmy.world · 4 pts · 80d
More moves for less disks?
christos@lemmy.world · 8 pts · 80d
Yup, this is fat finger mathematics. The correct number is 511, somehow zero got in the way.
besmtt@lemmy.world · 3 pts · 80d
Okay gotcha. Thank you!
christos@lemmy.world · 2 pts · 79d
I have just updated the script, now up to 13 disks available (optimal moves: 8191).
It will take a while to solve it...
lornosaj@lemmy.world · 1 pts · 80d
I might be just tired, but it took me a stupidly long second to get that minimum number of moves formula - not to nitpick, but isn’t that exp. usually written as 2^n - 1 ?
christos@lemmy.world · 3 pts · 80d
I don't know, it is not often that I use exp in writing, however:
lornosaj@lemmy.world · 3 pts · 80d
Ah gotcha, TIL something.
christos@lemmy.world · 1 pts · 80d
Same here
ImgurRefugee114@reddthat.com · 7 pts · 81d
Didn't know it had a name but that makes sense... I remember playing a minigame puzzle like that as a kid in KOTOR