Robot Movement

Cody is a robot on an N×N grid. Let (i,j) denote the cell in the i-th row from the top and the j-th column from the left. Each cell is either a wall or an empty cell, and every cell on the outermost border of the grid is a wall.

Cody wants to travel from the empty cell (2,2) to the empty cell (N−1,N−1).