Ximena Garcia made a laser design for the Tower of Hanoi puzzle. You make two of each disk and glue them together for nice chunky pieces. We use dot stampers (for bingo sheets) to color the wood. Works great! The laser files are in this folder on our webpage. Tower of Hanoi is a model of exponential growth – number of move to relocate stack is 2^0, 2^1, 2^2, …2 ^n where n is numberof stacks and its also a good way to talk about nested algorithms for computer programs.