Towers of Hanoi solution in Python

TowersOfHanoi.py

"""The Tower of Hanoi (also called the Tower of Brahma or Lucas' Tower,[1] and sometimes pluralised) 
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 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.
  
This class will print ou the moves that it takes to solve the puzzle"""

class Tower:

    def __init__(self):
        self.counter = 0

    def hanoi(self, n, a, c, b):
        if n == 1: 
            self.counter += 1
            print('{0}->{1}'.format(a, b))
        else:
            self.hanoi(n -1, a, b, c)
            self.hanoi(1, a, c, b)
            self.hanoi(n-1, b, c, a)

tower = Tower()
tower.hanoi(3,"a", "c", "b")

Simple Tower Of Hanoi Algorithm in Python from : https://www.geeksforgeeks.org/python-program-for-tower-of-hanoi/