In this work we study the maximal possible length of a walk on the grid graph $P_m \times P_n$, denoted by $M(P_m \times P_n)$. We capture $M(P_m \times P_n)$ within an additive factor of 1, thus, almost confirming McNeil's conjecture regarding $M(P^2_n)$.
PDF file