Markov Chains & Long-Run Behavior · Challenge problem

A random walker on the vertices of a regular hexagon moves each step to one of the two adjacent vertices with probability $1/2$ each. Starting at a vertex, what is the expected number of steps to first reach the opposite vertex?