da7e/amazing
1
0
Fork 0
mirror of https://github.com/maoakeEnterprise/amazing.git synced 2026-04-29 00:14:34 +02:00
Code Issues Packages Projects Releases Wiki Activity

Merge branch 'main' of github.com:maoakeEnterprise/amazing

Browse Source
This commit is contained in:
David GAILLETON
2026-03-24 16:12:19 +01:00
parent 6730ebcdb5 c478400640
commit 991cdead51
9 changed files with 182 additions and 44 deletions
Download Patch File Download Diff File Expand all files Collapse all files
src/amaz_lib/MazeSolver.py
+14 -27
View File
@@ -53,25 +53,25 @@ class AStar(MazeSolver):
print(actual)
path = {
"N": (
self.f((actual[0], actual[1] - 1))
if not maze[actual[0]][actual[1]].get_north() and actual[1] > 0
self.f((actual[1] - 1, actual[0]))
if not maze[actual[1]][actual[0]].get_north() and actual[0] > 0
else None
),
"E": (
self.f((actual[0] + 1, actual[1]))
if not maze[actual[0]][actual[1]].get_est()
and actual[0] < len(maze) - 1
self.f((actual[1], actual[0] + 1))
if not maze[actual[1]][actual[0]].get_est()
and actual[1] < len(maze) - 1
else None
),
"S": (
self.f((actual[0], actual[1] + 1))
if not maze[actual[0]][actual[1]].get_south()
and actual[1] < len(maze[0]) - 1
self.f((actual[1] + 1, actual[0]))
if not maze[actual[1]][actual[0]].get_south()
and actual[0] < len(maze) - 1
else None
),
"W": (
self.f((actual[0] - 1, actual[1]))
if not maze[actual[0]][actual[1]].get_west() and actual[0] > 0
self.f((actual[1], actual[0] - 1))
if not maze[actual[1]][actual[0]].get_west() and actual[1] > 0
else None
),
}
@@ -107,23 +107,10 @@ class AStar(MazeSolver):
case _:
return actual
def get_path(
self, actual: tuple[int, int], maze: np.ndarray, pre: str | None
) -> str | None:
if actual == self.end:
return ""
paths = self.best_path(maze, actual)
for path in paths:
if paths[path] is None:
continue
if path != pre:
temp = self.get_path(
self.get_next_pos(path, actual),
maze,
self.get_opposit(path),
)
if not temp is None:
return path + temp
def get_path(self, maze: np.ndarray) -> str | None:
actual = self.start
path = ""
return None
def solve(self, maze: Maze) -> str: