From dd23a3943f26863ad197eabfecc2761b9333c751 Mon Sep 17 00:00:00 2001
From: KislyuninED <egkis.06@mail.ru>
Date: Mon, 18 May 2026 12:20:24 +0000
Subject: [PATCH] [2] add more func to maze-core

---
 .../docks/data/2-st-exercize/maze-core.py     | 125 +++++++++++++++++-
 1 file changed, 124 insertions(+), 1 deletion(-)

diff --git a/KislyuninED/docks/data/2-st-exercize/maze-core.py b/KislyuninED/docks/data/2-st-exercize/maze-core.py
index 562af2a..3eddb9f 100644
--- a/KislyuninED/docks/data/2-st-exercize/maze-core.py
+++ b/KislyuninED/docks/data/2-st-exercize/maze-core.py
@@ -140,4 +140,127 @@ class TextFileMazeBuilder(MazeBuilder):
                     maze.set_cell(x, y, 'path')
         if start_en != 1 or exit_en != 1:
             raise ValueError(f"Labirint must have one S and one E. Found: S={start_en}, E={exit_en}")
-        return maze
\ No newline at end of file
+        return maze
+
+
+class PathFindingStrategy:
+    def find_path(self, maze, start, exit_cell):
+        raise NotImplementedError
+    
+    def _reconstruct_path(self, came_from, start, exit_cell):
+        path = []
+        current = exit_cell
+        while current is not None:
+            path.append(current)
+            current = came_from.get(current)
+        path.reverse()
+        return path
+    
+    def get_visited_count(self):
+        return getattr(self, '_visited_count', 0)
+
+
+class BFSStrategy(PathFindingStrategy):
+    def find_path(self, maze, start, exit_cell):
+        queue = deque()
+        queue.append(start)
+        came_from = {start: None}
+        visited = {start}
+        
+        while queue:
+            current = queue.popleft()
+            if current == exit_cell:
+                self._visited_count = len(visited)
+                return self._reconstruct_path(came_from, start, exit_cell)
+            for neighbor in maze.get_neighbors(current):
+                if neighbor not in visited:
+                    visited.add(neighbor)
+                    came_from[neighbor] = current
+                    queue.append(neighbor)
+        self._visited_count = len(visited)
+        return []
+
+
+class DFSStrategy(PathFindingStrategy):
+    def find_path(self, maze, start, exit_cell):
+        stack = [start]
+        came_from = {start: None}
+        visited = {start}
+        
+        while stack:
+            current = stack.pop()
+            if current == exit_cell:
+                self._visited_count = len(visited)
+                return self._reconstruct_path(came_from, start, exit_cell)
+            for neighbor in maze.get_neighbors(current):
+                if neighbor not in visited:
+                    visited.add(neighbor)
+                    came_from[neighbor] = current
+                    stack.append(neighbor)
+        self._visited_count = len(visited)
+        return []
+
+
+class AStarStrategy(PathFindingStrategy):
+    def _heuristic(self, cell, exit_cell):
+        return abs(cell.x - exit_cell.x) + abs(cell.y - exit_cell.y)
+    
+    def find_path(self, maze, start, exit_cell):
+        heap = []
+        counter = 0
+        start_f = self._heuristic(start, exit_cell)
+        heapq.heappush(heap, (start_f, counter, start))
+        counter += 1
+        
+        came_from = {}
+        g_score = {start: 0}
+        f_score = {start: start_f}
+        visited = set()
+        
+        while heap:
+            current_f, _, current = heapq.heappop(heap)
+            visited.add(current)
+            
+            if current == exit_cell:
+                self._visited_count = len(visited)
+                return self._reconstruct_path(came_from, start, exit_cell)
+            if current_f > f_score.get(current, float('inf')):
+                continue
+            for neighbor in maze.get_neighbors(current):
+                tentative_g = g_score[current] + 1
+                if tentative_g < g_score.get(neighbor, float('inf')):
+                    came_from[neighbor] = current
+                    g_score[neighbor] = tentative_g
+                    new_f = tentative_g + self._heuristic(neighbor, exit_cell)
+                    f_score[neighbor] = new_f
+                    heapq.heappush(heap, (new_f, counter, neighbor))
+                    counter += 1
+        self._visited_count = len(visited)
+        return []
+
+
+class SearchStats:
+    def __init__(self, time_ms, visited_cells, path_length):
+        self.time_ms = time_ms
+        self.visited_cells = visited_cells
+        self.path_length = path_length
+
+
+class MazeSolver:
+    def __init__(self, maze):
+        self._maze = maze
+        self._strategy = None
+    
+    def set_strategy(self, strategy):
+        self._strategy = strategy
+    
+    def solve(self):
+        if self._strategy is None:
+            return None
+        
+        start_time = time.perf_counter()
+        path = self._strategy.find_path(self._maze, self._maze.start, self._maze.exit)
+        end_time = time.perf_counter()
+        time_ms = (end_time - start_time) * 1000
+        
+        return SearchStats(time_ms, self._strategy.get_visited_count(), len(path))
\ No newline at end of file