Skip to content

matteodcr/HanoiTowers

Repository files navigation

projetinf101

What is the game of Tower of Hanoi? Tower of Hanoi consists of three pegs or towers with n disks placed one over the other. The objective of the puzzle is to move the stack to another peg following these simple rules.

• Only one disk can be moved at a time. • No disk can be placed on top of the smaller disk.

_from https://www.hackerearth.com/blog/developers/tower-hanoi-recursion-game-algorithm-explained/ _

Fonctionnalities

• Automatic Solver • Tkinter Interface for buttons, ... • turtle to draw the towers

Instructions run main.py

by Edgar ONGHENA Mattéo DECORSAIRE

About

This is a project in INF101

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published