apollo/maze-solver
1
0
Fork 0
Code Pull requests Projects Releases Packages Activity Actions
Maze Solver is a semi-guided Python project from boot.dev
24 commits 1 branch 0 tags 2.8 MiB
Python 99.7%
Dockerfile 0.2%
Shell 0.1%
Find a file
Dan Anglin 8466500092
feat: add the Randomised DST search algorithm 
Implement a variation to the DST search algorithm to the Solver class.
In this variation, the solver randomly chooses the next direction when
it reaches a fork in its path.
2024-02-17 01:37:20 +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 feat: add the Randomised DST search algorithm 2024-02-17 01:37:20 +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 feat: add the Randomised DST search algorithm 2024-02-17 01:37:20 +00:00
tests.py refactor: add a dedicated class for the solver 2024-02-16 23:27:09 +00:00

README.md

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