This is a great introduction in understanding Markov chains with the running example of calculating how many hops a knight can make around a chess before it returns to its starting position. Check it out.