A programme for computers to sort different sizes of blocks in order to build the perfect Tower of Hanoi!

Hanoi Tower.py

from turtle import *

class Disc(Turtle):
    def __init__(self, n):
        Turtle.__init__(self, shape="square", visible=False)
        self.pu()
        self.shapesize(1.5, n*1.5, 2)
        self.fillcolor(n/6., 0, 1-n/6.)
        self.st()

class Tower(list):
    "Hanoi tower, a subclass of built-in type list"
    def __init__(self, x):
        "create an empty tower. x is x-position of peg"
        self.x = x
    def push(self, d):
        d.setx(self.x)
        d.sety(-150+34*len(self))
        self.append(d)
    def pop(self):
        d = list.pop(self)
        d.sety(150)
        return d

def hanoi(n, from_, with_, to_):
    if n > 0:
        hanoi(n-1, from_, to_, with_)
        to_.push(from_.pop())
        hanoi(n-1, with_, from_, to_)

def play():
    onkey(None,"space")
    clear()
    try:
        hanoi(6, t1, t2, t3)
        write("The programme is over! Click the CROSS button to exit.",
              align="center", font=("Courier", 16, "bold"))
    except Terminator:
        pass

def main():
    global t1, t2, t3
    ht(); penup(); goto(0, -225)  
    t1 = Tower(-250)
    t2 = Tower(0)
    t3 = Tower(250)
    for i in range(6,0,-1):
        t1.push(Disc(i))
    write("Press the spacebar to start the programme",
          align="center", font=("Courier", 16, "bold"))
    onkey(play, "space")
    listen()
    return "EVENTLOOP"

if __name__=="__main__":
    msg = main()
    print(msg)
    mainloop()