Teaching Kids Programming – Nearest Exit from Entrance in Maze via Iterative Deepening Search Algorithm (IDS) | ninjasquad
You are given an m x n matrix maze (0-indexed) with empty cells (represented as ‘.’) and walls (represented as ‘+’). You are also given the entrance of the maze, where entrance = [entrancerow, entrancecol] denotes the row and column of the cell you are initially standing at.
In one step, you can move one cell up, down, left, or right. You cannot step into a cell with a wall, and you cannot step outside the maze. Your goal is to find the nearest exit from the entrance. An exit is defined as an empty cell that is at the border of the maze. The entrance does not count as an exit.
Return the number of steps in the shortest path from the entrance to the nearest exit, or -1 if no such path exists.
Input: maze = [[“+”,”+”,”.”,”+”],[“.”,”.”,”.”,”+”],[“+”,”+”,”+”,”.”]], entrance = [1,2]
Explanation: There are 3 exits in this maze at [1,0], [0,2], and [2,3].
Initially, you are at the entrance cell [1,2].
– You can reach [1,0] by moving 2 steps left.
– You can reach [0,2] by moving 1 step up.
It is impossible to reach [2,3] from the entrance.
Thus, the nearest exit is [0,2], which is 1 step away.
Input: maze = [[“+”,”+”,”+”],[“.”,”.”,”.”],[“+”,”+”,”+”]], entrance = [1,0]
Explanation: There is 1 exit in this maze at [1,2].
[1,0] does not count as an exit since it is the entrance cell.
Initially, you are at the entrance cell [1,0].
– You can reach [1,2] by moving 2 steps right.
Thus, the nearest exit is [1,2], which is 2 steps away.
Input: maze = [[“.”,”+”]], entrance = [0,0]
Explanation: There are no exits in this maze.
maze.length == m
maze[i].length == n
1 <= m, n <= 100
maze[i][j] is either ‘.’ or ‘+’.
entrance.length == 2
0 <= entrancerow < m
0 <= entrancecol < n
entrance will always be an empty cell.
Which type of traversal lets you find the distance from a point?
Try using a Breadth First Search.
We talked about using Breadth First Search (BFS) algorithm to find the shortest (optimal) path in a unweighted Graph (could either be directed or undirected). The problem with BFS is the large space complexity as it requires usage of a queue to hold all the elements/nodes in the same level/distance. We could use the Iterative Deepening Search (IDS) which is performing the BFS but in the DFS (Depth First Search) manner.
The core idea of Iterative Deepening Search Algorithm is that we increment the maximum depth limit one by one, and perform a Depth Limit Search (DLS) which is Depth First Search (DFS) with Limit meaning that when the depth exceeds a limit, the DFS has a hard stop.
The advantage of IDS is that we can find the shortest/optimal path, and we just need the similar space complexity as the DFS which is O(D) where D is the maximum depth of the visited Graph/Tree.
Likewise, to avoid visiting same nodes twice, we can mark and unmark the maze, or use a hash set.
GD Star Rating