Hacker News Reader

I'm still waiting for my Moment of Glory when a puzzle room or something has a Hanoi tower and I can slam out the solution as quickly as I can move the pieces, thus justifying all my formal Computer Science education once and for all.

(There is a very easy-to-remember algorithm that can be trivially executed by humans given here in a Mathologer video, with a time-code link to jump straight to it: https://youtu.be/MbonokcLbNo?si=ey8bv4T9KbDxgB7N&t=650 )

View on HN

If the Hanoi pieces alternate in color, there is another very easy algorithm: always avoid putting two pieces of the same color directly on top of each other. I noticed this by accident while watching someone else solve a Hanoi puzzle with alternating colored pieces. (The person I was watching didn't know this trick either. I suspect the manufacturers of the alternatingly colored puzzle also didn't know about it. So where did the knowledge come from?)

Reply on news.ycombinator.com