Game Design, Game Development, Math, Games, Mathematics.
Interestingly, these conditions fit both the Markov chain and random walks. Let’s consider the random walks of the first player: Moves have a probability of 0.5, because we just flip a coin, except for the extreme ones, they have 1. The walk graph can be easily transferred to a transition matrix: