{"id":17083431,"url":"https://github.com/ispobock/n_puzzle","last_synced_at":"2025-09-04T07:39:35.857Z","repository":{"id":223831363,"uuid":"303314963","full_name":"ispobock/N_puzzle","owner":"ispobock","description":"BFS \u0026 A* algorithm to solve N_puzzle problem","archived":false,"fork":false,"pushed_at":"2021-10-24T16:20:23.000Z","size":10,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2024-12-29T16:47:41.252Z","etag":null,"topics":["astar","bfs","npuzzle","python3"],"latest_commit_sha":null,"homepage":"","language":"Python","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/ispobock.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}},"created_at":"2020-10-12T07:41:19.000Z","updated_at":"2021-10-24T16:20:26.000Z","dependencies_parsed_at":"2024-02-22T09:58:45.770Z","dependency_job_id":null,"html_url":"https://github.com/ispobock/N_puzzle","commit_stats":null,"previous_names":["ispobock/n_puzzle"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ispobock%2FN_puzzle","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ispobock%2FN_puzzle/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ispobock%2FN_puzzle/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ispobock%2FN_puzzle/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ispobock","download_url":"https://codeload.github.com/ispobock/N_puzzle/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":236081167,"owners_count":19091748,"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":["astar","bfs","npuzzle","python3"],"created_at":"2024-10-14T13:01:13.852Z","updated_at":"2025-01-28T20:11:42.992Z","avatar_url":"https://github.com/ispobock.png","language":"Python","readme":"# N_puzzle\nTwo algorithms to solve [N_puzzle problem](https://en.wikipedia.org/wiki/15_puzzle).\n\n![8-puzzle-example](./figs/8-puzzle.png)\n\n## Requirements\n- Python3\n\n## Algorithms\n- BFS (Breadth-first search)\n    - Can find an optimal solution, but time-consuming.\n- A* algorithm\n    - An efficient heuristic algorithm.\n    - Cost function：`steps_from_start + manhattan_distance_to_goal`\n","funding_links":[],"categories":[],"sub_categories":[],"project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fispobock%2Fn_puzzle","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fispobock%2Fn_puzzle","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fispobock%2Fn_puzzle/lists"}