script.py

from stack import Stack

print("\nLet's play Towers of Hanoi!!")

#Create the Stacks
stacks = []
left_stack = Stack("Left")
middle_stack = Stack("Middle")
right_stack = Stack("Right")
stacks += [left_stack, middle_stack, right_stack]

#Set up the Game
num_disks = int(input("\nHow many disks do you want to play with?\n"))

while num_disks < 3:
  num_disks = int(input("Enter a number greater than or equal to 3\n"))

for i in range(num_disks, 0, -1):
  #from highest number to and including '1' in increments of -1. Range doesn't include the last number which is here '0'
  left_stack.push(i)

num_optimal_moves = 2**num_disks -1
print("The fastest you can solve this game is in {0} moves".format(num_optimal_moves))

#Get User Input

def get_input():
  choices = [stack.get_name()[0] for stack in stacks]
#This gets the first letter in the name of each stack as we can treat the string as a list of letters, 0 indexing the first.
  while True:

    for i in range(len(stacks)):
      name = stacks[i].get_name()
      letter = choices[i]
      print("Enter {0} for {1}".format(letter, name))
    user_input = input("")

    if user_input in choices:
      for i in range(len(stacks)):
        if user_input == choices[i]:
          return stacks[i]

#Play the Game
num_user_moves = 0

while right_stack.get_size() != num_disks:
  #While game is not finished
  print("\n\n\n...Current Stacks...")

  for i in range(len(stacks)):
    stacks[i].print_items()
  
  while True:
    print("\nWhich stack do you want to move from?")
    from_stack = get_input()
    print("\nWhich stack do you want to move to?")
    to_stack = get_input()

    if from_stack.is_empty():
      print("\n\nInvalid Move. Try Again!")  

    elif to_stack.is_empty() or from_stack.peek() < to_stack.peek():
      disk = from_stack.pop()
      to_stack.push(disk)
      num_user_moves += 1
      break

    else:
      print("\n\nInvalid Move. Try Again!") 
  
print("\n\nYou completed the game in {0} moves, and the optimal number of moves is {1}.".format(num_user_moves, num_optimal_moves))