This page contains a simple, recursive script that solves the Towers of Hanoi for any number of rings, moving them, ultimately, from post A to post B, using a third post, C.