This is a small program to solve the Towers of Hanoi puzzle for an arbitrary number of disks and pegs. It simply uses the A* search algorithm to find an optimal path in the search space of valid puzzle states.