Solution to the "Tower of Hanoi" problem on HackerRank.
-
Updated
May 28, 2022 - C++
Solution to the "Tower of Hanoi" problem on HackerRank.
Tower of Hanoi is a mathematical puzzle where we have three rods and n disks. The objective of the puzzle is to move the entire stack to another rod, obeying the following simple rules: player can only move one disk per turn and can never place a larger disk onto a smaller one at any time. this's a simple program to solve hanoi tower with n disk…
Tower of Hanoi running on EasyGraphics
It's a simple game of hanoi towers made in Unity. This is not made using Recursion, only Stacks and logic.
Problems and simulators made in Haskell
Implements the classic recursive solution to the Tower of Hanoi game
Cross platform Tower of Hanoi game using GLUT for Windows and freeglut for Linux and Mac.
CLI Hanoi Tower made with Python3
A simple Hanoi recognition, solution and manipulator's motion program.
Solution to the "Tower of Hanoi" problem.
Решение задачи 'Ханойская башня'
Hanoi game. Additionally can be used as a quest for 4 teams of 1-5 people.
Algoritmo Recursivo para la solución al juego "Torres de Hanoi" con 3 torres y N cantidad de discos.
Tower of Hanoi in Rust 🦀. It's a mathematical puzzle played with three rods and a number of disks of different sizes. The objective is to move all the disks from one rod to another, while following three simple rules.
Tower of Hanoi in JavaScript using Phaser.js
Add a description, image, and links to the hanoi-game topic page so that developers can more easily learn about it.
To associate your repository with the hanoi-game topic, visit your repo's landing page and select "manage topics."