Markov Chains & Long-Run Behavior · Superchallenge problem

A walker moves on the $16$ vertices of a four-dimensional cube, the binary strings of length $4$: each step it flips one of the four bits, chosen uniformly at random. Starting at $0000$, what is the expected number of steps until it first reaches $1111$? Express your answer as a common fraction.