{"id":20167249,"url":"https://github.com/pethical/towerofhanoi","last_synced_at":"2025-06-26T23:06:26.978Z","repository":{"id":94985446,"uuid":"217902102","full_name":"Pethical/TowerOfHanoi","owner":"Pethical","description":"Tower of Hanoi problem solving with java, without recursion and with strings as rods","archived":false,"fork":false,"pushed_at":"2019-11-01T16:16:53.000Z","size":76,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-03T03:41:58.933Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/Pethical.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2019-10-27T19:02:14.000Z","updated_at":"2019-11-01T16:16:55.000Z","dependencies_parsed_at":null,"dependency_job_id":"f7c6f4bb-1c57-4d7e-9a7e-a125a10e27f9","html_url":"https://github.com/Pethical/TowerOfHanoi","commit_stats":null,"previous_names":[],"tags_count":2,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Pethical%2FTowerOfHanoi","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Pethical%2FTowerOfHanoi/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Pethical%2FTowerOfHanoi/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Pethical%2FTowerOfHanoi/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Pethical","download_url":"https://codeload.github.com/Pethical/TowerOfHanoi/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Pethical%2FTowerOfHanoi/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":259280319,"owners_count":22833424,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2024-11-14T00:48:40.857Z","updated_at":"2025-06-11T14:13:10.184Z","avatar_url":"https://github.com/Pethical.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"[![GitHub license](https://img.shields.io/github/license/Pethical/TowerOfHanoi)](https://github.com/Pethical/TowerOfHanoi/blob/master/LICENSE)\n[![CodeFactor](https://www.codefactor.io/repository/github/pethical/towerofhanoi/badge)](https://www.codefactor.io/repository/github/pethical/towerofhanoi)\n[![Build Status](https://travis-ci.org/Pethical/TowerOfHanoi.svg?branch=master)](https://travis-ci.org/Pethical/TowerOfHanoi)\n[![codecov](https://codecov.io/gh/Pethical/TowerOfHanoi/branch/master/graph/badge.svg)](https://codecov.io/gh/Pethical/TowerOfHanoi)\n[![Known Vulnerabilities](https://snyk.io/test/github/Pethical/TowerOfHanoi/badge.svg?targetFile=pom.xml)](https://snyk.io/test/github/Pethical/TowerOfHanoi?targetFile=pom.xml)\n[![GitHub release](https://img.shields.io/github/release/Pethical/TowerOfHanoi.svg)](https://github.com/Pethical/TowerOfHanoi/releases/)\n\n# Tower of hanoi \nSolving the problem with java, without recursion, without arrays (using string as tower).\nWarning! This is an ineffecient and overcomplicated solution. do not follow this example!\n\n\n# Hanoi tornyai\n**A feladat:**\nKészítsünk programot java nyelven amely meg tudja oldani a \"Hanoi tornyai\" nevű matematikai feladványt! A megoldáshoz ne használjunk se tömböket se listákat (a tornyokhoz használnjuk Stringet) és ne használjunk rekurzíót sem (szervezzünk ciklusokat)\n\nA program képes megoldani a problémát és bármely állapotból képes a tornyokat az utolsó toronyra halmozni (azaz a kezdő állapot tetszőleges lehet).\n\n**Figyelem:** ez egy erősen komplikált és nem hatékony megoldás, ellenben rugalmas, konfigurálható és könnyen bővíthető.\nEnnél egyszerűbben, pár sor kóddal is meg lehet oldani. Ennek a megoldásnak a célja inkább, a java nyelv elemeinek, az OOP-nek, az egységtesztelésnek és az integrálható eszközöknek (pl. CI folyamatok) a reprezentálása.\n\n## Hogyan fordítsd\nA fordításhoz mavenre lesz szükséged és jdk8-ra. A következő paraccsal hozhatod létre a jar fájlokat:\n```\nmvn clean package\n```\n## Hogyan futtasd\n* Fordítsd le a fenti a paranccsal, vagy töltsd le a legfrissebb release-t.\n* Futtasd a hanoiGui-1.0-SNAPSHOT.jar fájlt a grafikus programhoz\n* Futtasd a HanoiConsole-1.0-SNAPSHOT.jar fájlt a konzolos programhoz\n\n![Screenshot](https://github.com/Pethical/TowerOfHanoi/blob/master/doc/gui-screeshot.PNG?raw=true)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpethical%2Ftowerofhanoi","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpethical%2Ftowerofhanoi","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpethical%2Ftowerofhanoi/lists"}