towers of hanoi is a classic problem demonstrating the usefullness of recursion. The object of the puzzle is to move the tower to another column all while not overlaping smaller disks with larger ones. See how just a few lines of python can solve the tower of hanoi problem with the trick of recursion!
https://commons.wikimedia.org/wiki/File:Iterative_algorithm_solving_a_6_disks_Tower_of_Hanoi.gif
~$ python3 hanoi.py