Link : https://www.geeksforgeeks.org/probability-knight-remain-chessboard/
In this q. , the author says that the prob of the knight remaining inside the board after k steps ( assuming it starts at position (x,y)) is same as the prob of reaching the position (x,y) in k steps . How can this be proved ? Is there any other approach to solve this problem?
GFG Chess board doubt
I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.
On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.