https://github.com/robertdinca2003/hanoi-towers
.Net Application C#, Hanoi Towers Algorithm Visualizer
https://github.com/robertdinca2003/hanoi-towers
csharp dotnet winforms
Last synced: 11 months ago
JSON representation
.Net Application C#, Hanoi Towers Algorithm Visualizer
- Host: GitHub
- URL: https://github.com/robertdinca2003/hanoi-towers
- Owner: robertDinca2003
- Created: 2022-10-08T09:30:17.000Z (over 3 years ago)
- Default Branch: main
- Last Pushed: 2023-09-30T12:57:52.000Z (over 2 years ago)
- Last Synced: 2025-03-29T01:33:00.240Z (about 1 year ago)
- Topics: csharp, dotnet, winforms
- Language: C#
- Homepage:
- Size: 34.2 KB
- Stars: 2
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Hanoi-Towers
.Net Application C#, Hanoi Towers Algorithm Visualizer
# Preview
https://github.com/robertDinca2003/Hanoi-Towers/assets/71851178/4c4c7841-dbcb-48f7-9ff8-85bfc5d0a87b
# Description
The Tower of Hanoi is a fascinating puzzle game involving three pegs and a stack of disks. The objective is to move the entire stack from one peg to another while following three simple rules:
- You can only move one disk at a time.
- A larger disk cannot be placed on top of a smaller one.
- The goal is to recreate the original stack on a different peg.
This seemingly simple game offers a surprisingly deep challenge, requiring players to think strategically to solve it. The Tower of Hanoi is a classic brain-teaser that has entertained and perplexed puzzle enthusiasts for generations.
# Usefull Tasks Completed
- Creating a playable Hanoi's Towers game, and can chose between 3-8 levels high tower
- Creating an algorithm to auto-play
- Creating a visualization of the game
# Competences
- The abillity to create a fully functional application
- The algoritmical knowladge which I possess
# Skills
- .Net, which incorporates WinForm applications. A very usefull tool for user intarface.
- C#, the programming language used for creating the whole logic behind the game.