Question: A lone knight performs a random walk on a chessboard. From any square, the knight looks at the squares that it can legally move to
A lone knight performs a random walk on a chessboard. From any square, the knight looks at the squares that it can legally move to in chess, and picks one uniformly at random to move to. If the knight starts this random walk at one of the corner squares of the chessboard, find the expected number of steps until the knight returns to its starting square.
Step by Step Solution
3.48 Rating (161 Votes )
There are 3 Steps involved in it
The stationary probab... View full answer
Get step-by-step solutions from verified subject matter experts
