Somewhere down the message list here was a conversation about the TofH game. I had my Intermediate Algebra students discover the pattern; calculate the number of moves for 70 disks; and the time it would take to solve it making 1-trillion moves per second (a long time).

It got me thinking (but not too much yet), what if the rules were the same, but at any step you could move 2 disks. But why stop there? How many moves will it take to solve using "m" disks if you can move at most "n" at any time? Hmmmm.

I should probably do a search on this before pressing send, but it's more fun to ponder it awhile.