Consider modeling the grid as a graph where each cell is a node and edges represent possible moves (up, down, left, right) between adjacent cells.

To determine if a unit can escape, check if there exists a path from the unit's starting position to any border cell of the grid, while avoiding obstacles or blocked cells.

Use a Breadth-First Search (BFS) or Depth-First Search (DFS) algorithm to explore all possible paths from the unit's starting position, marking visited cells to avoid cycles and redundant checks.