Maze Solver is a semi-guided Python project from boot.dev
Find a file
Dan Anglin 611935050b
refactor: DFS not DST
The searching algorithm is called Depth-First Search not DST.
2024-02-17 02:35:01 +00:00
.forgejo/workflows feat: add maze generation functionality 2024-02-14 22:50:46 +00:00
.github/workflows feat: add entrance, exit to the maze. 2024-02-13 15:52:28 +00:00
.gitignore feat: run a simple graphical window 2024-02-12 19:53:45 +00:00
cell.py refactor: add a dedicated class for the solver 2024-02-16 23:27:09 +00:00
errors.py feat: add maze generation functionality 2024-02-14 22:50:46 +00:00
graphics.py perf: reduce CPU usage whilst idle 2024-02-15 01:40:16 +00:00
LICENSE feat: run a simple graphical window 2024-02-12 19:53:45 +00:00
main.py refactor: DFS not DST 2024-02-17 02:35:01 +00:00
maze.py refactor: add a dedicated class for the solver 2024-02-16 23:27:09 +00:00
README.md docs: update README.md 2024-02-13 00:19:56 +00:00
solver.py refactor: DFS not DST 2024-02-17 02:35:01 +00:00
tests.py refactor: add a dedicated class for the solver 2024-02-16 23:27:09 +00:00

Maze Solver

Overview

This project is WIP.

The Maze Solver randomly generates a maze and systematically solves it.

Built with Python and Tkinter.

Repository mirrors