Markov Chains & Long-Run Behavior · Challenge problem

A token sits on one of three vertices. Each step it stays where it is with probability $1/2$ and otherwise moves to one of the other two vertices, each with probability $1/4$. Using the eigenvalues of the transition matrix, find the probability that after exactly $3$ steps the token is back on its starting vertex. Express your answer as a common fraction.