From 611935050b03ff88eba6efd095e3f3d3e072a88b Mon Sep 17 00:00:00 2001 From: Dan Anglin Date: Sat, 17 Feb 2024 02:35:01 +0000 Subject: [PATCH] refactor: DFS not DST The searching algorithm is called Depth-First Search not DST. --- main.py | 2 +- solver.py | 8 ++++---- 2 files changed, 5 insertions(+), 5 deletions(-) diff --git a/main.py b/main.py index 7e95568..8e8f619 100644 --- a/main.py +++ b/main.py @@ -18,7 +18,7 @@ def main(): solver = Solver(game) - if solver.solve(solver.solve_with_randomised_dst_r): + if solver.solve(solver.solve_with_randomised_dfs_r): print("Maze solved successfully :)") else: print("I'm unable to solve the maze :(") diff --git a/solver.py b/solver.py index d79a204..1b97ce7 100644 --- a/solver.py +++ b/solver.py @@ -44,7 +44,7 @@ class Solver: return solve_method(start_position, end_position) - def solve_with_dst_r( + def solve_with_dfs_r( self, current_position: MazePosition, end_position: MazePosition, @@ -77,7 +77,7 @@ class Solver: continue self._game.draw_path_between(current_position, adjacent_position) - solved = self.solve_with_dst_r(adjacent_position, end_position) + solved = self.solve_with_dfs_r(adjacent_position, end_position) if solved: return True self._game.draw_path_between( @@ -85,7 +85,7 @@ class Solver: return False - def solve_with_randomised_dst_r( + def solve_with_randomised_dfs_r( self, current_position: MazePosition, end_position: MazePosition, @@ -130,7 +130,7 @@ class Solver: chosen_direction, ) self._game.draw_path_between(current_position, next_position) - solved = self.solve_with_randomised_dst_r( + solved = self.solve_with_randomised_dfs_r( next_position, end_position) if solved: return True