Skip to content

Instantly share code, notes, and snippets.

View Sam9Ves3's full-sized avatar

Samuel Venegas Sam9Ves3

View GitHub Profile
@Brobin
Brobin / TowersOfHanoi.py
Last active September 21, 2022 07:48
Towers of Hanoi solution in Python
"""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