$5 \times 5$ UR grid

The number of paths from $(0,0)$ to $(m,n)$ moving only up or right is ${m+n \choose m}$ (you have to move a total of $m+n$ times, you pick $m$ times to move right). Furthermore, the number of paths that go through a specific point $(a,b)$ on the way to $(m,n)$ is simply $[\text{paths from }(0,0)\text{ to } (a,b)]\cdot[\text{paths from }(a,b)\text{ to } (m,n)]$ .

We now use the principle of inclusion-exclusion $\text{Safe paths} = \text{Total paths} - \text{Paths through one trap} + \text{Paths through two traps} - \text{Paths through three traps}$ Let $T_1$ , $T_2$ and $T_3$ denote the three traps. $\begin{aligned} \text{Safe paths} &= {10\choose 5} = 252 \\ \text{Paths through one trap} &= \text{Paths through }T_1 + \text{Paths through }T_2 + \text{Paths through }T_3\\ &= {4 \choose 2}{6 \choose 3} + {6 \choose 3}{4 \choose 2} + {8 \choose 4}{2 \choose 1} \\ &= 6\cdot 20 + 20\cdot 6 + 70\cdot 2 = 380 \\ \text{Paths through two traps} &= \text{Paths through }T_1 \text{ and } T_2 + \text{Paths through }T_1 \text{ and } T_3 + \text{Paths through }T_2 \text{ and } T_3 \\ &= {4 \choose 2}{2 \choose 1}{4 \choose 2} + {4 \choose 2}{4 \choose 2}{2 \choose 1} + {6 \choose 3}{2 \choose 1}{2 \choose 1} \\ &= 6\cdot 2\cdot 6 + 6\cdot 6\cdot 2 + 20\cdot 2\cdot 2 = 224 \\ \text{Paths through three traps} &= \text{Paths through }T_1 \text{ and } T_2 \text{ and } T_3 \\ &= {4 \choose 2}{2 \choose 1}{2 \choose 1}{2 \choose 1} \\ &= 6\cdot 2\cdot 2 \cdot 2 = 48 \end{aligned}$

Thus, we have $\text{Safe paths} = 252 - 380 + 224 - 48 = \boxed{48}$

I implemented the following algorithm using Microsoft Excel Visual Basic for Applictations (VBA).

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

Public Sub ibrahim()

n = routes(0, 0)

MsgBox (n)

End Sub

Public Function routes(ByVal i As Integer, ByVal j As Integer) As Integer

If i = 5 And j = 5 Then

   routes = 1

   Exit Function

End If

If (i > 5) Or (j > 5) Or (i = 2 And j = 2) Or (i = 3 And j = 3) Or (i = 4 And j = 4) Then

   routes = 0

   Exit Function

End If

k = routes(i + 1, j) + routes(i, j + 1)

routes = k

End Function

The output of the program is $48$ .