Project: PageRank Algorithm · Markov Chains

Lesson 3

Nikolai Chukhin · Alexander S. Kulikov

Problem. Consider the following random process: at each step, a knight makes a random move on a chessboard. Let \(\alpha_{i}\) be the position of the knight after \(i\) steps. Is \(\{\alpha_{i}\}_{i=0}^{\infty}\) a Markov chain?

5 points

  1. Yes, it is a Markov chain.

  2. No, it is not a Markov chain.