Dan Anglin
a091f0a68d
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.
81 lines
2.6 KiB
Python
81 lines
2.6 KiB
Python
from typing import Dict
|
|
from maze import Maze, MazeDirection, MazePosition
|
|
from cell import CellWallLabels
|
|
|
|
|
|
class Solver:
|
|
def __init__(self, game: Maze):
|
|
self._game = game
|
|
self._solver = "solver"
|
|
|
|
# This is a dictionary mapping the direction to the maze to the
|
|
# wall of the adjacent cell. It is used to identify the wall that could
|
|
# potentially block the solver's path.
|
|
# For example if the solver wants to move to the right, it's path
|
|
# could be blocked by the adjacent cell's left wall.
|
|
self._wall_map: Dict[MazeDirection, CellWallLabels] = {
|
|
MazeDirection.ABOVE: CellWallLabels.BOTTOM,
|
|
MazeDirection.BELOW: CellWallLabels.TOP,
|
|
MazeDirection.LEFT: CellWallLabels.RIGHT,
|
|
MazeDirection.RIGHT: CellWallLabels.LEFT,
|
|
}
|
|
|
|
def solve(self) -> bool:
|
|
"""
|
|
solve attempts to solve the generated maze.
|
|
"""
|
|
start_position = MazePosition(
|
|
i=0,
|
|
j=0,
|
|
last_i=self._game.get_last_i(),
|
|
last_j=self._game.get_last_j(),
|
|
)
|
|
|
|
end_position = MazePosition(
|
|
i=self._game.get_last_i(),
|
|
j=self._game.get_last_j(),
|
|
last_i=self._game.get_last_i(),
|
|
last_j=self._game.get_last_j(),
|
|
)
|
|
|
|
return self._solve_r(start_position, end_position)
|
|
|
|
def _solve_r(
|
|
self,
|
|
current_position: MazePosition,
|
|
end_position: MazePosition,
|
|
) -> bool:
|
|
if current_position == end_position:
|
|
return True
|
|
|
|
self._game.mark_cell_as_visited(
|
|
i=current_position.i,
|
|
j=current_position.j,
|
|
visitor=self._solver,
|
|
)
|
|
|
|
for direction in MazeDirection:
|
|
adjacent_position = current_position.get_adjacent_position(
|
|
direction
|
|
)
|
|
|
|
if adjacent_position is None:
|
|
continue
|
|
if self._game.cell_was_visited_by(
|
|
i=adjacent_position.i,
|
|
j=adjacent_position.j,
|
|
visitor=self._solver,
|
|
) or self._game.cell_wall_exists(
|
|
i=adjacent_position.i,
|
|
j=adjacent_position.j,
|
|
wall=self._wall_map[direction],
|
|
):
|
|
continue
|
|
|
|
self._game.draw_path_between(current_position, adjacent_position)
|
|
result = self._solve_r(adjacent_position, end_position)
|
|
if result is True:
|
|
return True
|
|
self._game.draw_path_between(current_position, adjacent_position, undo=True)
|
|
|
|
return False
|