My solutions to some Kattis problems.
-
Updated
Jan 5, 2018 - Java
My solutions to some Kattis problems.
Tower of Hanoi running on EasyGraphics
A solving method to the Towers of Hanoi problem, where given a number of cases at the first line, the program can solve the n cases recursively and print it on a file.
A simple GUI app to visualize how the HanoiTower solving algorithm is working
Algoritmo Recursivo para la solución al juego "Torres de Hanoi" con 3 torres y N cantidad de discos.
A visual Java implementation of the Hanoi Towers
Solution to the "Tower of Hanoi" problem.
Решение задачи 'Ханойская башня'
It is an open source and free software. It can be used to teach the concept of "Recursion" Or "Towers of Hanoi - Solutions" to computer science students. Shows on screen visually solution to Towers of Hanoi, optionally can produce text output of all disk movements. Note: It uses Java Applets.
This program is a variation of the well-known recursion problem called Hanoi Towers, in this case instead of showing to which tower to move the discs, the program shows the number of discs found in each tower after each movement
This program is to count the lowest step of Hanoi Problem for t Tower d Disk
Università di Trento - Soluzione compito di Linguaggi di Programmazione, Modulo 1 – giugno 2018
Sistemas informáticos, Universidade de Coimbra - Implementações em java virtual machines de sockets e servidores RMI.
Graphical solution to the Towers of Hanoi from 1 to 8 pieces in Java.
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."