Archit and Ayush are walking around on the set of points $(x,y)$ for all integers $-1\leq x,y\leq1$. Archit starts at $(1,1)$ and Ayush starts at $(1,0)$. Each second, they move to another point in the set chosen uniformly at random among the points with distance $1$ away from them. If the probability that Archit goes to the point $(0,0)$ strictly before Ayush does can be expressed as $\frac{m}{n}$ for relatively prime positive integers $m,n$, compute $m+n$.

[i]2020 CCA Math Bonanza Lightning Round #3.2[/i]