{"id":15765894,"url":"https://github.com/maxleiter/slidingnumberpuzzle","last_synced_at":"2025-03-31T10:43:07.199Z","repository":{"id":84709930,"uuid":"101431940","full_name":"MaxLeiter/SlidingNumberPuzzle","owner":"MaxLeiter","description":"Solve N x N sliding block number puzzles with A*","archived":false,"fork":false,"pushed_at":"2017-10-13T03:48:51.000Z","size":25,"stargazers_count":2,"open_issues_count":0,"forks_count":1,"subscribers_count":4,"default_branch":"master","last_synced_at":"2024-10-11T13:20:29.971Z","etag":null,"topics":["ai","astar-algorithm"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":false,"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/MaxLeiter.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}},"created_at":"2017-08-25T18:35:41.000Z","updated_at":"2020-05-19T23:10:32.000Z","dependencies_parsed_at":null,"dependency_job_id":"9cf9e2d7-2978-4e5c-88df-6b1b6f41b2ad","html_url":"https://github.com/MaxLeiter/SlidingNumberPuzzle","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MaxLeiter%2FSlidingNumberPuzzle","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MaxLeiter%2FSlidingNumberPuzzle/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MaxLeiter%2FSlidingNumberPuzzle/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/MaxLeiter%2FSlidingNumberPuzzle/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/MaxLeiter","download_url":"https://codeload.github.com/MaxLeiter/SlidingNumberPuzzle/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246458021,"owners_count":20780675,"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":["ai","astar-algorithm"],"created_at":"2024-10-04T13:00:36.830Z","updated_at":"2025-03-31T10:43:07.176Z","avatar_url":"https://github.com/MaxLeiter.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# SlidingNumberPuzzle\nA basic A* solver for the popular sliding puzzle game.\nFor solving a game like this\n![this](https://sr.ht/KVOp.jpg)\n\nCompile:\n`javac *.java`\n\nUsage:\n`java SlidingPuzzle --numbers 1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,0`\n\nPuzzles can be any `N x N` matrix. No steps are made to check if a puzzle is solvable, so you probably should make sure it's solvable before inputting it. \n\nAdd `--verbose` to print every visited state (even when not part of the solution).\n\nThis was made for an Artificial Intelligence independent study for two seniors in highschool. Don't judge too much.\n\nExample:\n\n`java SlidingPuzzle --numbers 5,0,2,8,6,4,7,3,1`\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmaxleiter%2Fslidingnumberpuzzle","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmaxleiter%2Fslidingnumberpuzzle","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmaxleiter%2Fslidingnumberpuzzle/lists"}