A simple solver for the Tower of Hanoi puzzle. The code is deliberately kept short to highlight the recursive algorithm. Usually this puzzle is animated with stacks of discs of different size on three pegs. Here each disc is represented by a number, and the three pegs are lists. The rules then are as follows: You start with an ordered list of numbers on Peg1. You need to move this list to Peg3. You can only move the bottom element of one list to the bottom of another. And each list needs to remain ordered from low to high values.
