Binary counting can solve the towers of Hanoi puzzle, and if this isn't surprising enough, it can lead to a method for finding a curve that fills Sierpinski's triangle ...
========== Today I want to share with you a neat way
to solve the towers of Hanoi puzzle just by counting in a different number system, and surprisingly this stuff relates to
finding a curve that fills Sierpinski triangle. I learned about this from a former CS lecturer of mine, his name is Keith Schwarz. And I've got to say, this man is one of
the best educators that I've ever met. I actually recorded a bit of the conversation
where he showed me this stuff, so you guys can hear some of
what he described directly. It's weird, I'm not normally the sort of person
who likes little puzzles and games, but I just love looking at the analysis
of puzzles and games, and I love just looking at mathematical patterns and (ask): where does that come from? In case you aren't unf...