Linear AlgebraSuperchallengeMarkov Chains & Long-Run Behavior
Markov Chains & Long-Run Behavior · Superchallenge problem
Two tokens sit on opposite vertices of a regular octagon. Each second, both tokens move simultaneously and independently, each to one of its two neighbouring vertices with probability . What is the expected number of seconds until the tokens first occupy the same vertex?