maze-solver/main.py

from graphics import Window
from maze import Maze
from solver import Solver


def main():
    window = Window(800, 800)

    game = Maze(
        x_position=10,
        y_position=10,
        height=19,
        width=19,
        cell_height=40,
        cell_width=40,
        window=window
    )

    solver = Solver(game)

    if solver.solve(solver.solve_with_bfs_r, True):
        print("Maze solved successfully :)")
    else:
        print("I'm unable to solve the maze :(")

    window.mainloop()


if __name__ == "__main__":
    main()
feat: move Cell class to separate module. 2024-02-12 23:48:41 +00:00			`from graphics import Window`
feat: add the Maze class The Maze class stored a 2-dimensional grid of Cells. When the Maze is initialised, the Cell's are created and drawn onto the canvas. 2024-02-13 12:18:47 +00:00			`from maze import Maze`
refactor: add a dedicated class for the solver Create a separate class to represent the solver of the maze. Additional search algorithms will be implemented here. Additional changes: - Add public methods to mark cells as visited and to get results of the visits. - Renamed MazeDirections to MazeDirection. - Renamed _num_cell_rows to _height. - Renamed _num_cells_per_row to _width. - Created a dedicated method to configure a cell's walls in the Maze class. - created a dedicated public method to draw a path between two cells in the Maze class. 2024-02-16 23:27:09 +00:00			`from solver import Solver`
feat: run a simple graphical window Run a simple window and draw a few lines on it. 2024-02-12 19:53:45 +00:00

			`def main():`
			`window = Window(800, 800)`
feat: add the Cell class Add the Cell class to represent a grid in the maze. Each 'Cell' can be configured to specify which walls exists for it. 2024-02-12 23:32:03 +00:00
feat: add the algorithm to solve the maze 2024-02-15 19:13:31 +00:00			`game = Maze(`
perf: reduce CPU usage whilst idle When the Maze Solver was idle the wait_for_close() loop ran which continuously redrew the window in an infinite while loop. This caused the CPU usage to spike between 70%-80%. This commit removes that method and uses the _root.mainloop() instead to keep the window visible on the screen. With this the CPU usage has dropped to > 1% when idle. 2024-02-15 01:40:16 +00:00			`x_position=10,`
			`y_position=10,`
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			`height=19,`
			`width=19,`
refactor: add a dedicated class for the solver Create a separate class to represent the solver of the maze. Additional search algorithms will be implemented here. Additional changes: - Add public methods to mark cells as visited and to get results of the visits. - Renamed MazeDirections to MazeDirection. - Renamed _num_cell_rows to _height. - Renamed _num_cells_per_row to _width. - Created a dedicated method to configure a cell's walls in the Maze class. - created a dedicated public method to draw a path between two cells in the Maze class. 2024-02-16 23:27:09 +00:00			`cell_height=40,`
			`cell_width=40,`
perf: reduce CPU usage whilst idle When the Maze Solver was idle the wait_for_close() loop ran which continuously redrew the window in an infinite while loop. This caused the CPU usage to spike between 70%-80%. This commit removes that method and uses the _root.mainloop() instead to keep the window visible on the screen. With this the CPU usage has dropped to > 1% when idle. 2024-02-15 01:40:16 +00:00			`window=window`
			`)`
feat: add draw_move method to Cell Add the draw_move method to the Cell class to draw a path between the centre of two cells. 2024-02-13 10:48:26 +00:00
refactor: add a dedicated class for the solver Create a separate class to represent the solver of the maze. Additional search algorithms will be implemented here. Additional changes: - Add public methods to mark cells as visited and to get results of the visits. - Renamed MazeDirections to MazeDirection. - Renamed _num_cell_rows to _height. - Renamed _num_cells_per_row to _width. - Created a dedicated method to configure a cell's walls in the Maze class. - created a dedicated public method to draw a path between two cells in the Maze class. 2024-02-16 23:27:09 +00:00			`solver = Solver(game)`

feat: add the BFS search algorithm to Solver Add the BFS algorithm to the Solver class. This method can be executed with or without random directions enabled. 2024-02-17 03:39:24 +00:00			`if solver.solve(solver.solve_with_bfs_r, True):`
feat: add the algorithm to solve the maze 2024-02-15 19:13:31 +00:00			`print("Maze solved successfully :)")`
			`else:`
			`print("I'm unable to solve the maze :(")`

perf: reduce CPU usage whilst idle When the Maze Solver was idle the wait_for_close() loop ran which continuously redrew the window in an infinite while loop. This caused the CPU usage to spike between 70%-80%. This commit removes that method and uses the _root.mainloop() instead to keep the window visible on the screen. With this the CPU usage has dropped to > 1% when idle. 2024-02-15 01:40:16 +00:00			`window.mainloop()`
feat: run a simple graphical window Run a simple window and draw a few lines on it. 2024-02-12 19:53:45 +00:00

			`if __name__ == "__main__":`
			`main()`