{"id":19166225,"url":"https://github.com/faizanf33/15-puzzle-game","last_synced_at":"2026-06-08T16:32:47.452Z","repository":{"id":172097233,"uuid":"257025900","full_name":"Faizanf33/15-Puzzle-Game","owner":"Faizanf33","description":"Greedy Algorithm (AI)","archived":false,"fork":false,"pushed_at":"2020-04-19T15:28:39.000Z","size":4,"stargazers_count":1,"open_issues_count":0,"forks_count":2,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-22T23:17:07.846Z","etag":null,"topics":["15-puzzle","15-puzzle-solver","15puzzle","console-game","greedy-algorithm","greedy-algorithms","python"],"latest_commit_sha":null,"homepage":null,"language":"Python","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/Faizanf33.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":"2020-04-19T14:51:37.000Z","updated_at":"2023-11-15T16:18:56.000Z","dependencies_parsed_at":"2024-01-25T21:15:13.541Z","dependency_job_id":null,"html_url":"https://github.com/Faizanf33/15-Puzzle-Game","commit_stats":null,"previous_names":["faizanf33/15-puzzle-game"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/Faizanf33/15-Puzzle-Game","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Faizanf33%2F15-Puzzle-Game","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Faizanf33%2F15-Puzzle-Game/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Faizanf33%2F15-Puzzle-Game/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Faizanf33%2F15-Puzzle-Game/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/Faizanf33","download_url":"https://codeload.github.com/Faizanf33/15-Puzzle-Game/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/Faizanf33%2F15-Puzzle-Game/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":34071653,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-05-26T15:22:16.424Z","status":"online","status_checked_at":"2026-06-08T02:00:07.615Z","response_time":111,"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":["15-puzzle","15-puzzle-solver","15puzzle","console-game","greedy-algorithm","greedy-algorithms","python"],"created_at":"2024-11-09T09:31:55.828Z","updated_at":"2026-06-08T16:32:47.432Z","avatar_url":"https://github.com/Faizanf33.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"## 15-Puzzle-Game (Greedy Approach)\n_______________________________\n\n- *Accidental implementation* (Expected was heuristic approach)\n- Simple logic/no big deal.\n\n\u003e How it works:\n\u003e 1. Given an array(1-D) as initial state **(Must be of len=16)**.\n\u003e 2. Check whether goal state is reachable.\n\u003e 3. Find the position of empty **None** block.\n\u003e 4. Enlist possible moves.\n\u003e 5. Find the cost of each move.\n\u003e 6. Apply move with the minimum cost.\n\u003e 7. Repeat 4,5,6 until goal state is found.\n\n### Why algorithm fails for fairly complicated/large problems.\n- Algorithm moves on the basis of current possible moves (no track/record).\n- Moves with no/same minimum cost ends to repetition.\n- Repetition is somehow solved using randomness but complicates the problem.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffaizanf33%2F15-puzzle-game","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffaizanf33%2F15-puzzle-game","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffaizanf33%2F15-puzzle-game/lists"}