{"id":18887114,"url":"https://github.com/haydend100/mazesolver","last_synced_at":"2025-10-11T19:14:05.643Z","repository":{"id":231920849,"uuid":"783039354","full_name":"HaydenD100/MazeSolver","owner":"HaydenD100","description":"This program randomly generates a maze and then solves that maze using A* pathfinding algorithm","archived":false,"fork":false,"pushed_at":"2025-01-08T19:17:52.000Z","size":185,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-05-31T11:43:09.914Z","etag":null,"topics":["astar","astar-algorithm","astar-pathfinding","astar-search","astar-search-algorithm","cpp","maze","maze-algorithms","maze-generation-algorithms","maze-generator","maze-solver","prims-algorithm","prims-implementation","randomized-prim-algorithm"],"latest_commit_sha":null,"homepage":"","language":"C++","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/HaydenD100.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":"2024-04-06T19:12:43.000Z","updated_at":"2025-01-08T19:17:56.000Z","dependencies_parsed_at":"2025-05-26T10:05:18.916Z","dependency_job_id":null,"html_url":"https://github.com/HaydenD100/MazeSolver","commit_stats":null,"previous_names":["haydend100/mazesolver"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/HaydenD100/MazeSolver","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HaydenD100%2FMazeSolver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HaydenD100%2FMazeSolver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HaydenD100%2FMazeSolver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HaydenD100%2FMazeSolver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/HaydenD100","download_url":"https://codeload.github.com/HaydenD100/MazeSolver/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/HaydenD100%2FMazeSolver/sbom","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":267604469,"owners_count":24114537,"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-07-28T02:00:09.689Z","response_time":68,"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":["astar","astar-algorithm","astar-pathfinding","astar-search","astar-search-algorithm","cpp","maze","maze-algorithms","maze-generation-algorithms","maze-generator","maze-solver","prims-algorithm","prims-implementation","randomized-prim-algorithm"],"created_at":"2024-11-08T07:34:14.358Z","updated_at":"2025-10-11T19:14:00.621Z","avatar_url":"https://github.com/HaydenD100.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Maze Generator and solver\nThis project is a combination of two algorithms that I had recently implemented: Randomized Prim's which is an algorithm that randomly generates mazes, The algorithm starts by picking a given node in the graph, with which it begins the MST. It then finds the shortest edge from the MST to a node that is not in the MST, and adds that node. You can read more on Randomized Prim's algoirthm at: https://en.wikipedia.org/wiki/Maze_generation_algorithm\n\nThe Second algorithm is A*. A* is a path finding algorithm invented by Peter Hart. A* finds the shortest path to a destination using a cost function F = G + H H is how far the tile is from the end destination and G is how far a tile is from the starting destination. The algorithm moves by picking the lowest F cost and then calculating all the costs of the tiles surrounding it adding it to a list of all the calculate tiles (this is shown in blue in my implementation) and then picking the lowest cost from those tiles. You can read more about the A star Algorithm at: https://en.wikipedia.org/wiki/A*_search_algorithm#:~:text=A*%20is%20an%20informed%20search,shortest%20time%2C%20etc\n\nUsing these two algorithms this program generates a random maze and then solves it by finding the shortest path from the start tile(light blue) to the end tile (light green)\n\n# GIF's of the program\n![gif](/docs/assets/gifVideo.gif)\n![gif](/docs/assets/gif2Video.gif)\n\n# Development\nCoded in c++ with SDL2 for rendering.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhaydend100%2Fmazesolver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fhaydend100%2Fmazesolver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fhaydend100%2Fmazesolver/lists"}