{"id":17998017,"url":"https://github.com/thatdns/running-mazey","last_synced_at":"2025-03-26T04:31:38.832Z","repository":{"id":135143028,"uuid":"196635361","full_name":"ThatDNS/Running-Mazey","owner":"ThatDNS","description":"Intelligent Mazey finds path through a maze!","archived":false,"fork":false,"pushed_at":"2024-07-05T16:52:07.000Z","size":2354,"stargazers_count":7,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"master","last_synced_at":"2025-03-21T06:41:31.594Z","etag":null,"topics":["ai","algorithms-implemented","graph-algorithms","heuristic-search-algorithms","maze-game","maze-generator","maze-solver"],"latest_commit_sha":null,"homepage":"","language":"JavaScript","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/ThatDNS.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":"2019-07-12T19:34:56.000Z","updated_at":"2024-07-05T16:52:10.000Z","dependencies_parsed_at":"2024-10-29T22:03:48.803Z","dependency_job_id":null,"html_url":"https://github.com/ThatDNS/Running-Mazey","commit_stats":null,"previous_names":["thatdns/running-mazey"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ThatDNS%2FRunning-Mazey","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ThatDNS%2FRunning-Mazey/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ThatDNS%2FRunning-Mazey/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/ThatDNS%2FRunning-Mazey/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/ThatDNS","download_url":"https://codeload.github.com/ThatDNS/Running-Mazey/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":245589265,"owners_count":20640254,"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","algorithms-implemented","graph-algorithms","heuristic-search-algorithms","maze-game","maze-generator","maze-solver"],"created_at":"2024-10-29T21:23:34.378Z","updated_at":"2025-03-26T04:31:37.986Z","avatar_url":"https://github.com/ThatDNS.png","language":"JavaScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Running Mazey\nThis program generates a random maze from an initial grid and then Mazey (an A.I. :P) finds the approximate shortest path from top left corner to the bottom right corner of the grid.\n\n## Algorithm Used: A* Search Algorithm\n\nA* is a computer algorithm that is widely used in pathfinding and graph traversal, which is the process of finding a path between multiple points, called \"nodes\".\u003cbr\u003e\nPeter Hart, Nils Nilsson and Bertram Raphael of Stanford Research Institute (now SRI International) first published the algorithm in 1968. It can be seen as an extension of Edsger Dijkstra's 1959 algorithm.\u003cbr\u003e\nA* achieves better performance by using heuristics to guide its search.\n\n## Step 1: Maze Generation\n###### source: [Maze generation algorithms](https://en.wikipedia.org/wiki/Maze_generation_algorithm)\n\n\u003cimg src=\"media/mazeGeneration.gif\" height=300\u003e\n\n## Step 2: Finding the shortest path from top left corner to bottom right corner\n###### source: [A* Search Alogrithm](https://en.wikipedia.org/wiki/A*_search_algorithm)\n\n\u003cimg src=\"media/mazeyRunning.gif\" height=300\u003e\n\n## Final path\n\n\u003cimg src=\"media/path.png\" height=300\u003e\n\n## Author\n\n\n\u003ctable\u003e\n\u003ctr\u003e\n\u003ctd\u003e\n\u003cimg src=\"https://avatars3.githubusercontent.com/u/31174685?s=460\u0026v=4\" width=\"180\"/\u003e\n\nDivyanshu N Singh\n\n\u003cp align=\"center\"\u003e\n\u003ca href = \"https://github.com/DNS-404\"\u003e\u003cimg src = \"http://www.iconninja.com/files/241/825/211/round-collaboration-social-github-code-circle-network-icon.svg\" width=\"36\" height = \"36\"/\u003e\u003c/a\u003e\n\u003ca href = \"https://twitter.com/divyanshunsingh\"\u003e\u003cimg src = \"https://www.shareicon.net/download/2016/07/06/107115_media.svg\" width=\"36\" height=\"36\"/\u003e\u003c/a\u003e\n\u003ca href = \"https://www.linkedin.com/in/divyanshunsingh/\"\u003e\u003cimg src = \"http://www.iconninja.com/files/863/607/751/network-linkedin-social-connection-circular-circle-media-icon.svg\" width=\"36\" height=\"36\"/\u003e\u003c/a\u003e\n\u003c/p\u003e\n\u003c/td\u003e\n\u003c/tr\u003e \n\u003c/table\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthatdns%2Frunning-mazey","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fthatdns%2Frunning-mazey","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fthatdns%2Frunning-mazey/lists"}