{"id":31940246,"url":"https://github.com/stolsky/generate-and-solve-mazes","last_synced_at":"2026-07-30T09:31:34.040Z","repository":{"id":188655972,"uuid":"679144176","full_name":"stolsky/generate-and-solve-mazes","owner":"stolsky","description":"Visualization of the generation and solution of mazes with various algorithms.","archived":false,"fork":false,"pushed_at":"2025-03-13T22:17:00.000Z","size":378,"stargazers_count":0,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"production","last_synced_at":"2025-03-13T23:25:09.292Z","etag":null,"topics":["maze","maze-algorithms","maze-generation","maze-solving","simulation","visualization"],"latest_commit_sha":null,"homepage":"","language":"TypeScript","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/stolsky.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,"publiccode":null,"codemeta":null}},"created_at":"2023-08-16T07:35:31.000Z","updated_at":"2025-03-13T22:17:04.000Z","dependencies_parsed_at":"2023-12-28T13:20:19.628Z","dependency_job_id":"340cb309-e266-47fb-916f-15d22f174d27","html_url":"https://github.com/stolsky/generate-and-solve-mazes","commit_stats":{"total_commits":141,"total_committers":4,"mean_commits":35.25,"dds":"0.17021276595744683","last_synced_commit":"92bb089b348419c997ad921515f74cb50dbd7e8e"},"previous_names":["w0lf3n/generate-and-solve-mazes","stolsky/generate-and-solve-mazes"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/stolsky/generate-and-solve-mazes","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stolsky%2Fgenerate-and-solve-mazes","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stolsky%2Fgenerate-and-solve-mazes/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stolsky%2Fgenerate-and-solve-mazes/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stolsky%2Fgenerate-and-solve-mazes/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/stolsky","download_url":"https://codeload.github.com/stolsky/generate-and-solve-mazes/tar.gz/refs/heads/production","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/stolsky%2Fgenerate-and-solve-mazes/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":279018312,"owners_count":26086348,"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-10-14T02:00:06.444Z","response_time":60,"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":["maze","maze-algorithms","maze-generation","maze-solving","simulation","visualization"],"created_at":"2025-10-14T08:52:42.698Z","updated_at":"2025-10-14T08:52:55.827Z","avatar_url":"https://github.com/stolsky.png","language":"TypeScript","funding_links":[],"categories":[],"sub_categories":[],"readme":"## Abstract\nVisualization of the generation and solution of mazes with various algorithms.\n\n## NaPAC - Not another Pathfinding Algorithm Comparison\n\u003c!-- Why another comparison? \nList reasons\n--\u003e\n\n### Different types of mazes\n* [ ] from long corridores (few forks) to small passages and many forks\n* [ ] multiple solutions vs. unique solution (different maze generators)\n* [ ] sparse (many clean areas like connected caves) vs. dense maze (only passages)\n* [ ] circles vs circle-free\n\n### Create your own maze\n* [ ] set dimensions (width, height)\n* [ ] set different grids by selecting rectangle, triangle or hexagonal cells\n* [ ] set type of mazes\n  * perfect, with circles\n  * only with sparse/moderate/dense obstacles\n* [ ] set the start and goal position yourself\n* [ ] force the random path (solution) to be short, medium or long\n* [ ] set your own seed\n  * to analyze the same maze with different algorithms, start and goal positions, etc.\n* [ ] select own maze generator\n* [ ] dig your maze by yourself (in one/some/every iteration)\n* [ ] choose path finding algorithms\n* [ ] tests different heuristics (taxicab, euclidean distance) for A* or other algorithms\n* [ ] set flood option to flood the maze/playground after generation to visualize certain qualities\n\n### Automation-galore\n* [ ] provide ready to go setup\n* [ ] select different start and goal positions in every iteration to not favour a specific algorithm\n\n### Better control over the simulation\n* [ ] play and pause the simulation any time\n* [ ] change the simulation speed\n* [ ] skip generation or solving to get faster to the results\n* [ ] set auto pause after generation and/or solution to view the result\n\n### Add more algorithms\n* [ ] right-hand side algorithm\n* [ ] left-hand side algorithm\n\n## Inspirations\n* [A Comparison of Pathfinding Algorithms](https://www.youtube.com/watch?v=GC-nBgi9r0U)\n* [Path-finding Visualization Comparison](https://www.youtube.com/watch?v=aW9kZcJx64o)\n* [Path finding algorithms comparison](https://www.youtube.com/watch?v=-bdFEaNeZMM)\n* [Green Code - I Solved The World's Hardest Maze (with Code)](https://www.youtube.com/watch?v=4L7BDRmH4cM)\n\n## Research Algorithms\n* [Path Finding comparison](https://www.youtube.com/watch?v=tW1V2Xhabe8)\n* [Variants of A*](https://en.wikipedia.org/wiki/A*_search_algorithm)\n* [Jump Point Search - Wikipedia](https://en.wikipedia.org/wiki/Jump_point_search)\n* [Jump Point Search - GameDev.net](https://www.gamedev.net/tutorials/programming/artificial-intelligence/jump-point-search-fast-a-pathfinding-for-uniform-cost-grids-r4220/)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstolsky%2Fgenerate-and-solve-mazes","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fstolsky%2Fgenerate-and-solve-mazes","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fstolsky%2Fgenerate-and-solve-mazes/lists"}