2025 SSMO Accuracy Round Problems/Problem 6
Problem
Andy the ant starts at the square labeled 
. On each move Andy moves to any orthogonal square (a square with which his current square shares a side). What is the expected number of moves before Andy is in the square labeled 
?
![[asy] unitsize(1cm); int[][] grid = { {0, 0, 0}, {0, 0, 0}, {0, 0, 0} }; grid[0][0] = 1; grid[2][2] = 2; for (int i = 0; i <= 3; ++i) { draw((0,i)--(3,i),black); draw((i,0)--(i,3),black); } for (int i = 0; i < 3; ++i) { for (int j = 0; j < 3; ++j) { if (grid[i][j] != 0) { } } } [/asy]](http://latex.artofproblemsolving.com/d/1/d/d1d1e87072c9a636bd0fe0db7a5a77c3c0219391.png)
