🐍 Algorithme de la tour de Hanoi en python
-
Updated
Dec 14, 2014 - Python
🐍 Algorithme de la tour de Hanoi en python
The Tower of Hanoi 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. Object of the game is to move all the disks over to another tower. But you cannot place a larger disk onto a smaller disk.
Solução do problema da Torre-De-Hanoi para N discos com Depth-First Search
A simple GUI app to visualize how the HanoiTower solving algorithm is working
A JavaScript solution for Hanoi tower puzzle.
The famous Hanoi game written in Go. Thanks to @skelterjohn for his lib, go-matrix, that you can find in https://github.com/skelterjohn/go.matrix
Simulation of solving Towers of Hanoi.
A more generalized and extended solution to the Hanoi Tower puzzle. [FINISHED]
Massachusetts Institute of Technology MOOC | Notion of computation; Python programming language; Simple algorithms; Testing and debugging; Introduction to algorithmic complexity; Data structures
My solutions to some Kattis problems.
A bachelor's thesis project at Faculty of Electrical Engineering and Computing, University of Zagreb. In this project, machine learning algorithm "qlearning" is used to solve the Towers of Hanoi problem. After off-line learning, Baxter robot is used to physically play all the moves required to optimally solve the problem.
A Windows 8.1 Universal App, demonstrating the mathematical game "The Tower of Hanoi"
Programas de la materia
Ncurses implementation fo Hanoi towers
Add a description, image, and links to the hanoi-towers topic page so that developers can more easily learn about it.
To associate your repository with the hanoi-towers topic, visit your repo's landing page and select "manage topics."