欢迎您访问程序员文章站本站旨在为大家提供分享程序员计算机编程知识!
您现在的位置是: 首页  >  IT编程

用python实现汉诺塔问题

程序员文章站 2023-12-31 16:26:58
用动画实现汉诺塔问题: import turtle class Stack: def __init__(self): self.items = [] def isEmpty(self): return len(self.items) == 0 def push(self, item): self.i ......

用动画实现汉诺塔问题:

import turtle

class stack:
    def __init__(self):
        self.items = []
    def isempty(self):
        return len(self.items) == 0
    def push(self, item):
        self.items.append(item)
    def pop(self):
        return self.items.pop()
    def peek(self):
        if not self.isempty():
            return self.items[len(self.items) - 1]
    def size(self):
        return len(self.items)

def drawpole_3():#画出汉诺塔的poles
    t = turtle.turtle()
    t.hideturtle()
    def drawpole_1(k):
        t.up()
        t.pensize(10)
        t.speed(100)
        t.goto(400*(k-1), 100)
        t.down()
        t.goto(400*(k-1), -100)
        t.goto(400*(k-1)-20, -100)
        t.goto(400*(k-1)+20, -100)
    drawpole_1(0)#画出汉诺塔的poles[0]
    drawpole_1(1)#画出汉诺塔的poles[1]
    drawpole_1(2)#画出汉诺塔的poles[2]

def creat_plates(n):#制造n个盘子
    plates=[turtle.turtle() for i in range(n)]
    for i in range(n):
        plates[i].up()
        plates[i].hideturtle()
        plates[i].shape("square")
        plates[i].shapesize(1,8-i)
        plates[i].goto(-400,-90+20*i)
        plates[i].showturtle()
    return plates

def pole_stack():#制造poles的栈
    poles=[stack() for i in range(3)]
    return poles

def movedisk(plates,poles,fp,tp):#把poles[fp]顶端的盘子plates[mov]从poles[fp]移到poles[tp]
    mov=poles[fp].peek()
    plates[mov].goto((fp-1)*400,150)
    plates[mov].goto((tp-1)*400,150)
    l=poles[tp].size()#确定移动到底部的高度(恰好放在原来最上面的盘子上面)
    plates[mov].goto((tp-1)*400,-90+20*l)

def movetower(plates,poles,height,frompole, topole, withpole):#递归放盘子
    if height >= 1:
        movetower(plates,poles,height-1,frompole,withpole,topole)
        movedisk(plates,poles,frompole,topole)
        poles[topole].push(poles[frompole].pop())
        movetower(plates,poles,height-1,withpole,topole,frompole)

myscreen=turtle.screen()
drawpole_3()
n=int(input("请输入汉诺塔的层数并回车:\n"))
plates=creat_plates(n)
poles=pole_stack()
for i in range(n):
    poles[0].push(i)
movetower(plates,poles,n,0,2,1)
myscreen.exitonclick()

  用python实现汉诺塔问题

上一篇:

下一篇: