Hello everyone!
I'm back, and I've got lots of exciting math to share, so let's get to it! This week, I'd like to talk about a classic puzzle called the Towers of Hanoi. To start, we have a board with three pegs, as shown below, one of which has a stack of disks on it. We want to move all the disks from the starting peg to either of the other pegs.However, we have two constraints: we can only move one disk at a time, from one peg to another, and we can never place a disk on top of a smaller disk. So in the example below, we can move the middle disk onto the larger disk on the left, but not the smaller disk on the right.
Continue reading Towers of Hanoi






