{"id":26518242,"url":"https://github.com/cu-sanjay/maze-solver","last_synced_at":"2025-03-21T09:27:50.239Z","repository":{"id":205019707,"uuid":"713214531","full_name":"cu-sanjay/Maze-Solver","owner":"cu-sanjay","description":"Mazes Solver and Pathfinding Algorithm using Depth-First Search (DFS) in Python Simple program.","archived":false,"fork":false,"pushed_at":"2024-04-08T18:02:47.000Z","size":15919,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2024-04-10T00:41:29.669Z","etag":null,"topics":["dfs-algorithm","maze-solver"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","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/cu-sanjay.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":"2023-11-02T04:07:55.000Z","updated_at":"2024-04-08T18:00:14.000Z","dependencies_parsed_at":null,"dependency_job_id":"144a7316-51a0-4eff-95c2-9b3a13783f06","html_url":"https://github.com/cu-sanjay/Maze-Solver","commit_stats":null,"previous_names":["cu-sanjay/614-a-daa-project"],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cu-sanjay%2FMaze-Solver","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cu-sanjay%2FMaze-Solver/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cu-sanjay%2FMaze-Solver/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/cu-sanjay%2FMaze-Solver/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/cu-sanjay","download_url":"https://codeload.github.com/cu-sanjay/Maze-Solver/tar.gz/refs/heads/main","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":244770345,"owners_count":20507601,"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":["dfs-algorithm","maze-solver"],"created_at":"2025-03-21T09:27:49.636Z","updated_at":"2025-03-21T09:27:50.232Z","avatar_url":"https://github.com/cu-sanjay.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Maze Solver / Pathfinding Prowess \n# ⬆️⬇️⬅️➡️↘️↙️↖️↗️\n\nIn this project, we explore real-world applications of Depth-First Search (DFS), mazes, and pathfinding algorithms.\n\n## 🗒️ Table of Contents\n- [Definitions](#definitions)\n- [How It Works](#how-it-works)\n- [Example](#example-for-better-understanding)\n- [Project Details](#project-details)\n- [Screenshots](#screenshots)\n\n## 📝 Definitions\n\n### 🔍 Depth-First Search (DFS)\nDepth-First Search is a graph traversal algorithm used to explore nodes in a systematic manner. It starts at the root node and explores as far as possible along each branch before backtracking. DFS is often used in maze-solving and graph traversal applications.\n\n### 🧩 Maze\nA maze is a complex, branching puzzle that includes choices of paths and dead ends. In the context of this project, a maze is represented as a grid of cells, where some cells are walls, and others are open paths.\n\n### 🛣️ Pathfinding\nPathfinding is the process of finding a path from a starting point to a destination point in a maze or graph. Different algorithms, such as DFS and Breadth-First Search (BFS), are used to find the most efficient path.\n\n## 🧠 How It Works\n\nThe project employs the DFS algorithm to solve mazes. The DFS algorithm explores the maze, trying to find a path from the start cell to the goal cell. It backtracks when it reaches dead-ends and keeps exploring other paths until it finds a solution.\n\n## 📺 Example for Better Understanding\n\n\u003cp align=\"center\"\u003e\n  \u003cimg src=\"https://github.com/cu-sanjay/614-A-DAA-Project/assets/96792511/8ff73088-ef7d-4b41-9f30-1621541f2eb4\" width=\"400\" alt=\"Output with Square\"\u003e\n\u003c/p\u003e\n\nThe DFS solver explores the maze, and after backtracking and exploration, it finds a path to the goal cell.\n\n## 🚶🏾‍♂️Project Details\n\nThis project uses the **pyamaze** library to create mazes, visualize the exploration process, and find the path. The code provided in the **src** repository demonstrates how to create a maze, apply the DFS algorithm to solve it, and visualize the results.\n\n## 📱 Screenshots\n\n\u003ctable align=\"center\"\u003e\n  \u003ctr\u003e\n    \u003ctd\u003e\n      \u003cimg src=\"https://github.com/cu-sanjay/614-A-DAA-Project/assets/96792511/fb8c120c-3459-4685-ba6f-9ce87e3fdfe8\" width=\"400\" alt=\"Output with Square\"\u003e\n    \u003c/td\u003e\n    \u003ctd\u003e\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcu-sanjay%2Fmaze-solver","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcu-sanjay%2Fmaze-solver","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcu-sanjay%2Fmaze-solver/lists"}