{"id":15442685,"url":"https://github.com/university-project-repos/ai__a-star_search","last_synced_at":"2025-03-28T07:24:57.054Z","repository":{"id":266977763,"uuid":"840798482","full_name":"University-Project-Repos/AI__A-star_search","owner":"University-Project-Repos","description":null,"archived":false,"fork":false,"pushed_at":"2024-08-10T18:04:56.000Z","size":36,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-02-02T08:18:39.187Z","etag":null,"topics":["a-star","algorithms","alpha-beta-pruning","artificial-intelligence","computer-science","constraint-satisfaction-problem","graph-search","machine-learning","minimax","optimisation","path-finding","planning-algorithms","predicate-logic","probabilistic-inference","prolog","propositional-logic","python-3","software-engineering","university-of-canterbury","university-project"],"latest_commit_sha":null,"homepage":"","language":"Python","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/University-Project-Repos.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":"2024-08-10T18:03:28.000Z","updated_at":"2024-11-14T22:21:27.000Z","dependencies_parsed_at":"2024-12-07T12:41:39.595Z","dependency_job_id":"0d71962e-8b0a-4690-881c-e9a02aab19e7","html_url":"https://github.com/University-Project-Repos/AI__A-star_search","commit_stats":null,"previous_names":["university-project-repos/ai__a-star_search"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/University-Project-Repos%2FAI__A-star_search","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/University-Project-Repos%2FAI__A-star_search/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/University-Project-Repos%2FAI__A-star_search/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/University-Project-Repos%2FAI__A-star_search/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/University-Project-Repos","download_url":"https://codeload.github.com/University-Project-Repos/AI__A-star_search/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245986276,"owners_count":20705189,"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":["a-star","algorithms","alpha-beta-pruning","artificial-intelligence","computer-science","constraint-satisfaction-problem","graph-search","machine-learning","minimax","optimisation","path-finding","planning-algorithms","predicate-logic","probabilistic-inference","prolog","propositional-logic","python-3","software-engineering","university-of-canterbury","university-project"],"created_at":"2024-10-01T19:29:21.841Z","updated_at":"2025-03-28T07:24:57.002Z","avatar_url":"https://github.com/University-Project-Repos.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# COSC367 Artificial Intelligence - A* Search\n\nFinds the minimum cost path between a start and goal node implementing A* multiple-path pruning\n\n# Instructions\n\n## Requirements\n\n* Python3\n\n## Run\n\n```bash\npython3 test_a_star.py\n```\n\n# Example\n\nAlternatively, view the [generated output](./results/output.dat):\n\n```bash\nStarting nodes: [(1, 3, 9), (3, 2, inf), (3, 5, 0)]\nOutgoing arcs (available actions) at starting states:\n(1, 3, 9)\n  Arc(tail=(1, 3, 9), head=(1, 4, 8), label='E', cost=2)\n  Arc(tail=(1, 3, 9), head=(2, 2, 8), label='SW', cost=2)\n  Arc(tail=(1, 3, 9), head=(1, 2, 8), label='W', cost=2)\n(3, 2, inf)\n  Arc(tail=(3, 2, inf), head=(2, 2, inf), label='N', cost=2)\n  Arc(tail=(3, 2, inf), head=(3, 3, inf), label='E', cost=2)\n  Arc(tail=(3, 2, inf), head=(3, 1, inf), label='W', cost=2)\n(3, 5, 0)\n\nIs (1, 1, 5) goal? False\nOutgoing arcs (available actions) at (1, 1, 5):\n  Arc(tail=(1, 1, 5), head=(1, 2, 4), label='E', cost=2)\n  Arc(tail=(1, 1, 5), head=(2, 2, 4), label='SE', cost=2)\n\nIs (1, 7, 2) goal? True\nOutgoing arcs (available actions) at (1, 7, 2):\n  Arc(tail=(1, 7, 2), head=(2, 7, 1), label='S', cost=2)\n  Arc(tail=(1, 7, 2), head=(2, 6, 1), label='SW', cost=2)\n\nIs (3, 6, 5) goal? False\nOutgoing arcs (available actions) at (3, 6, 5):\n  Arc(tail=(3, 6, 5), head=(2, 6, 4), label='N', cost=2)\n  Arc(tail=(3, 6, 5), head=(2, 7, 4), label='NE', cost=2)\n  Arc(tail=(3, 6, 5), head=(3, 7, 4), label='E', cost=2)\n  Arc(tail=(3, 6, 5), head=(3, 5, 4), label='W', cost=2)\n  Arc(tail=(3, 6, 5), head=(3, 6, 9), label='Fuel up', cost=5)\n\nIs (3, 6, 9) goal? False\nOutgoing arcs (available actions) at (3, 6, 9):\n  Arc(tail=(3, 6, 9), head=(2, 6, 8), label='N', cost=2)\n  Arc(tail=(3, 6, 9), head=(2, 7, 8), label='NE', cost=2)\n  Arc(tail=(3, 6, 9), head=(3, 7, 8), label='E', cost=2)\n  Arc(tail=(3, 6, 9), head=(3, 5, 8), label='W', cost=2)\n\nStarting nodes: [(1, 2, inf)]\nOutgoing arcs (available actions) at the start:\n  Arc(tail=(1, 2, inf), head=(1, 1, inf), label='W', cost=2)\n\nIs (1, 1, 1) goal? True\nOutgoing arcs (available actions) at (1, 1, 1):\n  Arc(tail=(1, 1, 1), head=(1, 2, 0), label='E', cost=2)\n\nStarting nodes: [(1, 1, inf), (1, 6, inf), (3, 1, inf)]\nActions:\n  N,\n  N.\nTotal cost: 4\n\nActions:\n  E,\n  E,\n  E,\n  NE,\n  NE.\nTotal cost: 10\n\nActions:\n  N,\n  NE,\n  Fuel up,\n  SW,\n  SE,\n  E,\n  E,\n  E,\n  NE,\n  N.\nTotal cost: 23\n\nActions:\n  W.\nTotal cost: 2\n\nActions:\n  W,\n  W.\nTotal cost: 4\n\nActions:\n  SE,\n  E.\nTotal cost: 4\n\nThere is no solution!\n\nThere is no solution!\n\nActions:\n  SE,\n  E,\n  Fuel up,\n  E,\n  E,\n  E,\n  E,\n  E,\n  E,\n  E,\n  E,\n  SE,\n  Fuel up,\n  NE,\n  E,\n  E,\n  NE,\n  NW,\n  N,\n  Fuel up,\n  SW,\n  W,\n  W,\n  W,\n  W,\n  W,\n  W,\n  W,\n  W.\nTotal cost: 67\n\n+-------+\n|     XG|\n|X XXX* |\n| S***  |\n+-------+\n\n+--+\n|GS|\n+--+\n\n+----+\n|    |\n| SX |\n| X*G|\n+----+\n\n+------------+\n|            |\n|            |\n|            |\n|    S       |\n|   *        |\n|  *         |\n| G          |\n|            |\n+------------+\n\n+------------+\n|  ......    |\n|  ......    |\n|  ......    |\n|  ..S...    |\n|  .*....    |\n|  *.....    |\n| G......    |\n|            |\n+------------+\n\n+---------------+\n|    G*******   |\n|XXXXXXXXXXXX*  |\n|..******...X*. |\n|.*XXXXXX*..X*..|\n|.*X.S**X*..X*..|\n|.*X....*...X*..|\n|.*XXXXXXXXXX*..|\n|..**********...|\n+---------------+\n\n+---------+\n|         |\n|    G    |\n|         |\n+---------+\n\n+-------------+\n|         G   |\n| S      .*.  |\n|         S   |\n+-------------+\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Funiversity-project-repos%2Fai__a-star_search","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Funiversity-project-repos%2Fai__a-star_search","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Funiversity-project-repos%2Fai__a-star_search/lists"}