{"id":26339420,"url":"https://github.com/promathbul/tower_of_hanoi","last_synced_at":"2025-10-11T14:36:54.133Z","repository":{"id":143655802,"uuid":"579028713","full_name":"PromathBul/Tower_of_hanoi","owner":"PromathBul","description":"Решение задачи 'Ханойская башня'","archived":false,"fork":false,"pushed_at":"2022-12-16T13:34:42.000Z","size":1,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-08-08T21:49:23.753Z","etag":null,"topics":["hanoi","hanoi-game","hanoi-towers","java","recursion","recursive-algorithm","recursive-functions"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/PromathBul.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"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,"zenodo":null}},"created_at":"2022-12-16T13:34:15.000Z","updated_at":"2022-12-16T13:35:49.000Z","dependencies_parsed_at":"2023-05-05T16:00:43.159Z","dependency_job_id":null,"html_url":"https://github.com/PromathBul/Tower_of_hanoi","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/PromathBul/Tower_of_hanoi","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PromathBul%2FTower_of_hanoi","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PromathBul%2FTower_of_hanoi/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PromathBul%2FTower_of_hanoi/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PromathBul%2FTower_of_hanoi/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/PromathBul","download_url":"https://codeload.github.com/PromathBul/Tower_of_hanoi/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/PromathBul%2FTower_of_hanoi/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279007451,"owners_count":26084313,"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","status":"online","status_checked_at":"2025-10-11T02:00:06.511Z","response_time":55,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"can_crawl_api":true,"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":["hanoi","hanoi-game","hanoi-towers","java","recursion","recursive-algorithm","recursive-functions"],"created_at":"2025-03-16T03:17:26.375Z","updated_at":"2025-10-11T14:36:54.128Z","avatar_url":"https://github.com/PromathBul.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Задача\nНаписать программу, показывающую последовательность действий для игры “Ханойская башня”.\n\n# Решение\nЗадача решается рекурсивно.\nПо сути решение имеет фрактальную природу и повторяет себя.\n\n_**Рассуждения**_\n\nПусть мы умеем перекладывать `n` дисков, тогда и `n + 1` мы также можем переложить.\nПускай нам надо переложить `n + 1` дисков на стержень-приемник. Так как мы умеем перекладывать `n` дисков, то мы эту стопку переложим на вспомогательный стержень. \n\nЗатем, положив самый большой диск на стержень-приемник, мы воспользуемся тем, что умеем перекладывать стопку из `n` элементов и переложим эту стопку со вспомогательного стержня на стержень-приемник. \n\nТаким образом, мы можем двигаться рекурсивно от любого `n` дисков к последнему самому большому.","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpromathbul%2Ftower_of_hanoi","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fpromathbul%2Ftower_of_hanoi","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fpromathbul%2Ftower_of_hanoi/lists"}