In chess, the king can move one square at a time in any direction (horizontally
Chapter 11, Problem 11(choose chapter or problem)
In chess, the king can move one square at a time in any direction (horizontally, vertically, or diagonally). For example, in the diagram, from the current position the king can move to any of 8 possible squares. A king is wandering around on an otherwise empty 8 8 chessboard, where for each move all possibilities are equally likely. Find the stationary distribution of this chain (of course, dont list out a vector of length 64 explicitly! Classify the 64 squares into types and say what the stationary probability is for a square of each type).
Unfortunately, we don't have that question answered yet. But you can get it answered in just 5 hours by Logging in or Becoming a subscriber.
Becoming a subscriber
Or look for another answer