Portal 2

Portal 2

191 ratings
Hanoi
   
Award
Favorite
Favorited
Unfavorite

Subscribe to download
Hanoi

In 1 collection by Mikeastro
Mikeastro's Logic Maps
77 items
Description
And there you have it - my first zero portals 'puzzle'. A map dedicated to my friend Joric.
Back in February, he published a map which was a remake of the second room of this map.[forums.thinking.withportals.com]
Using his words, possibly quoting yet someone else: ''Room 2 is one of the best implementations of the Towers of Hanoi I've seen in any game, Portal or otherwise''.
Sadly, I couldn't even see the connection between that room and the Towers of Hanoi. But still the idea lingered. If that was one of the best implementations, and I couldn't even see why, surely I would be able to do it even better.
I thought about this on and off for a long time, but I couldn't find an elegant way to recreate this classic puzzle in Portal. This morning on the train I had a brainwave and it was so simple that I hit myself on the head for not seeing it sooner.
Therefore I proudly present you:
The Towers of Hanoi... in Portal 2.

I hope that you guys like it - at least, I'm really glad with the way this turned out.
I've just been thinking of this game much too abstractly lately, as a real pedantic mathematician should. But don't worry - after this I will be back to making regular maps again (probably :p).
Difficulty: 3/10.
Optional companion cube is obtainable - that's also a first.

Final note: the number of cube movements increases even more rapidly than in the original problem. Namely, for N cubes, the solution to this variant of the towers of Hanoi requires 2*3^(N-1)-1 cube movements, which greatly exceeds 2^N - 1, which is the answer for the classic version of the puzzle. Contrary to the result in my map Theorem, in which the complexity of the puzzle could only increase quadratically with the number of cubes, this time it grows exponentially. That's pretty bad.

Of course I won't copystrike you for the music if you record your run :p
In other news: My puzzle game Sokoban: The RPG has been released on steam! Please consider checking it out!

Playthrough by 可砸的六度双音
Blind run by asears16
56 Comments
StackSmasher789 Apr 7 @ 7:12am 
A ton of running in this. Bunnyhopping is the quickest way to solve this if you already know the algorithm.
QuickSinger21 Jan 27 @ 2:21pm 
I like this it's fun if you know how to count in binary
Probably John Dec 5, 2023 @ 3:35pm 
Cool map and cool concept, but n=4 was too much I think...
Mr Fab Dec 26, 2022 @ 12:15am 
10/10 would Hanoi again :steamthumbsup:
Aneonen Dec 6, 2021 @ 7:34pm 
Very creative chamber! The Hanoi structure definitely checks out. I'm sure someone could formalize the type of structure you can get out of Portal 2 to describe what ideas can be translated into this format, but maybe that wouldn't be worth the time, haha. I am curious to see how 2*3^(n-1)-1 is reached by generalizing, though; maybe I'll come back some day.

@Andy T The 'Hanoi' comes from the fact that actually executing the solution for a large tower size is 'Hannoying'
Andy T Aug 15, 2021 @ 12:15am 
OK, I do wonder why the game is called Tower of Hanoi? I can understand the Tower, no idea why Hanoi.
kwinten Oct 7, 2020 @ 9:05am 
this is a great idea ! (this is not the best implementation i can imagine, but with PTI only that seems fair enough), thumbs up !
Mikeastro  [author] Oct 2, 2020 @ 4:45am 
@freddiPhil Thank you :] I'm glad you enjoyed this silly map
freddiPhil Oct 1, 2020 @ 8:15am 
Really nice implementation of the hanoi tower principle. Thank you for that experience.
Mikeastro  [author] Sep 6, 2020 @ 10:26am 
@meowmini Thanks a lot for playing! I'm happy to hear that you liked it :]