Question
In a treacherous 6 x 6 2D mine grid, an aging tank starts its journey from the top left corner. The tank's objective is to safely reach the bottom right corner, but it faces a grave challenge:
avoiding the hidden mines scattered throughout the grid. To navigate the perilous terrain, the tank can only move right or down from any given cell.
Your task is to determine the total count of distinct paths the tank can take to reach the bottom right cell without encountering a deadly mine.
Calculate the number of safe routes the tank can explore, ensuring its successful passage through the grid?
100000
0000M0
000000
0M0000
00000D
Where,
T is the initial position of the tank
M represents a cell with mine
e represents a cell which is safe to move
D represents the destination cell
Example:
If the grid size is 2 x 2 with one mine at the bottom left corner,
TO
MD
The only possible path here is:
T -> move to right -> move to down
Note: Put the answer as an integer without any padded zeroes or decimal points. For example, if the answer is 1, then please put 1 as the answer and not 1.0 or 01 or 001.
