Please write a simply code in python, the requirement is as followed: The Tower of Hanoi is a mathematical game or puzzle. It consists of three rods, and a number of disks of different sizes which can slide onto any rod. The puzzle starts with the disks in a neat stack in ascending order of size on one rod, the smallest at the top, thus making a conical shape. The following figure shows the initial state of the Tower of Hanoi with 5 disks.The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: 1. Only one disk can be moved at a time. 2. Each move consists of taking the upper disk from one of the stacks and placing it on top of another stack i.e. a disk can only be moved if it is the uppermost disk on a stack. 3. No disk may be placed on top of a smaller disk. Assume that initially all the disks are placed on rod A. Write a non-recursive Python function to print out the steps to move all the disks from rod A to rod C via rod B (Hint: a recursive algorithm can be converted into a non-recursive algorithm using stack). The header of the function is: def HanoiTower(n) Here n represents the number of disks. example: when n = 3, the program will output: A -> C 换行 A -> B 换行 C -> B 换行 A -> C 换行 B -> A 换行 B -> C 换行 A -> C

这是一个使用非递归算法实现的汉诺塔问题的 Python 代码：

def HanoiTower(n):
  stack = []
  stack.append((n, 'A', 'B', 'C'))
  
  while len(stack) > 0:
    n, from_rod, aux_rod, to_rod = stack.pop()
    
    if n == 1:
      print(from_rod, "->", to_rod)
    else:
      stack.append((n-1, aux_rod, from_rod, to_rod))
      stack.append((1, from_rod, aux_rod, to_rod))
      stack.append((n-1, aux_rod, to_rod, from_rod))
      
# 测试代码
HanoiTower(3)

这段代码使用了一个 stack 来模拟递归过程。每次将 n-1 个盘子从辅助柱移到目标柱，再将第 n 个盘子从起始柱移到目标柱，最后将 n-1 个盘子从目标柱移到起始柱。这样就可以在不使用递归的情况下解决汉诺塔问题了。

这段代码的输出结果应该是这样的：

A -> C
A -> B
C -> B
A -> C
B -> A
B -> C
A -> C