Python汉诺塔问题交互界面

Python汉诺塔问题是一个经典的递归问题，它涉及到将一堆圆盘从一个柱子移动到另一个柱子，每一步只能移动一个较大的圆盘，并且总是将较小的圆盘放在较大的圆盘上面。为了创建一个交互式界面，你可以使用Python的图形用户界面库如Tkinter或者更现代的GUI库如PyQt或Kivy。

下面是一个简单的交互式Hanoi Tower的例子，我们将通过命令行让用户输入圆盘的数量：

import tkinter as tk
from tkinter import messagebox

def hanoi(n, source, auxiliary, target):
    if n > 0:
        # Move n - 1 disks from source to auxiliary using target
        hanoi(n - 1, source, target, auxiliary)
        
        # Move the nth disk from source to target
        print(f"Move disk {n} from {source} to {target}")
        
        # Move the n - 1 disks that were on auxiliary back to target using source
        hanoi(n - 1, auxiliary, source, target)

def start_hanoi():
    try:
        num_disks = int(entry.get())
        if num_disks < 1:
            messagebox.showerror("Invalid Input", "Please enter a positive integer.")
        else:
            hanoi(num_disks, 'A', 'B', 'C')  # A, B, C are the names of the pegs
    except ValueError:
        messagebox.showerror("Invalid Input", "Please enter a positive integer.")

# Create the GUI
root = tk.Tk()
root.title("Hanoi Tower")

label = tk.Label(root, text="Number of Disks:")
entry = tk.Entry(root)
button = tk.Button(root, text="Start", command=start_hanoi)

label.pack()
entry.pack()
button.pack()

root.mainloop()

在这个示例中，用户会在文本框中输入圆盘数，然后点击“开始”按钮，程序会显示移动过程。