This project implements a maze pathfinding solution where an assassin navigates through a maze while avoiding walls and guards. The guards' vision marks certain cells as "observed," which the assassin must avoid. The BFS algorithm is used to find the shortest path to the target, with visual representation of the maze and exploration process.
-
Updated
Mar 3, 2025 - Python