Let $L_{m,m}$ be a $2D$ lattice. Also, suppose that there is a random walker located in position $(0,0)$. The random walker goes right, left, up, or down randomly in each step and cannot get out of $L_{m,m}$.
What is the expected number of steps that the random walker needs to reach $(m,m)$ with high probability?