Maze Solver is a semi-guided Python project from boot.dev
Find a file
Dan Anglin 32696f311d
refactor: add MazeDirections and MazePositions
- Created a new enum type called MazeDirections to represent the
  directions you can make in the maze.
- Created a class called MazePosition to represent the position on the
  maze grid. It has the functionality to calculate and return adjacent
  positions.
- Used the above two additions to refactor the _break_walls_r method and
  make it a bit easier to read.
2024-02-15 14:58:51 +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 fix: create a separate visited variable for solver 2024-02-15 03:45:01 +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 perf: reduce CPU usage whilst idle 2024-02-15 01:40:16 +00:00
maze.py refactor: add MazeDirections and MazePositions 2024-02-15 14:58:51 +00:00
README.md docs: update README.md 2024-02-13 00:19:56 +00:00
tests.py refactor: add MazeDirections and MazePositions 2024-02-15 14:58:51 +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