diff --git a/raskatovia/docs/data/task2/solver.py b/raskatovia/docs/data/task2/solver.py
index e69de29..ae1b9f4 100644
--- a/raskatovia/docs/data/task2/solver.py
+++ b/raskatovia/docs/data/task2/solver.py
@@ -0,0 +1,58 @@
+from collections import deque
+from maze import MazeBuilder
+
+def build_path(previous, start, finish):
+    if finish not in previous:
+        return []
+    path = []
+    current = finish
+    while current != start:
+        path.append(current)
+        current = previous[current]
+    path.append(start)
+    path.reverse()
+    return path
+
+class BfsStrategy:
+    def solve(self, maze):
+        start = maze.start
+        finish = maze.finish
+        queue = deque([start])
+        previous = {start: None}
+        visited_count = 0
+
+        while queue:
+            current = queue.popleft()
+            visited_count += 1
+
+            if current == finish:
+                break
+
+            for next_cell in maze.neighbors(current[0], current[1]):
+                if next_cell not in previous:
+                    previous[next_cell] = current
+                    queue.append(next_cell)
+
+        path = build_path(previous, start, finish)
+        return {
+            "name": "BFS",
+            "path": path,
+            "visited": visited_count,
+            "length": len(path)
+        }
+
+class MazeSolver:
+    def __init__(self, strategy):
+        self.strategy = strategy
+
+    def solve(self, maze):
+        return self.strategy.solve(maze)
+
+if __name__ == "__main__":
+    maze = MazeBuilder().from_file("raskatovia/docs/data/task2/maps/simple.txt").build()
+    solver = MazeSolver(BfsStrategy())
+    result = solver.solve(maze)
+    print("algorithm:", result["name"])
+    print("visited:", result["visited"])
+    print("length:", result["length"])
+    print(maze.draw(result["path"]))
\ No newline at end of file