Problem description:

On an NxN chessboard, a knight starts at the r-th row and c-th column and attempts to make exactly K moves. The rows and columns are 0 indexed, so the top-left square is (0, 0), and the bottom-right square is (N-1, N-1).

A chess knight has 8 possible moves it can make, as illustrated below. Each move is two squares in a cardinal direction, then one square in an orthogonal direction.

Each time the knight is to move, it chooses one of eight possible moves uniformly at random (even if the piece would go off the chessboard) and moves there.

The knight continues moving until it has made exactly K moves or has moved off the chessboard. Return the probability that the knight remains on the board after it has stopped moving.

1
2
3
4
5
6
7
Example:

Input: 3, 2, 0, 0
Output: 0.0625
Explanation: There are two moves (to (1,2), (2,1)) that will keep the knight on the board.
From each of those positions, there are also two moves that will keep the knight on the board.
The total probability the knight stays on the board is 0.0625.

Note:

N will be between 1 and 25.
K will be between 0 and 100.
The knight always initially starts on the board.

Solution:

First of all, the probability of staying in the board after k turns is $something/8^k$
We create a 2D dp board to calculate the times that knight can move to position[i][j].
The idea is to think of it as 2D dp, but do the transfer multiple times.

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
class Solution {
public:
    vector<vector<int>> dirs{{2,1}, {-2,1}, {2,-1}, {-2,-1}, {1,2}, {-1,2}, {1,-2}, {-1,-2}};
    double knightProbability(int N, int K, int row, int col) {
        vector<vector<double>> dp(N, vector<double>(N, 0.0));
        dp[row][col]= 1;
        for(int k= 0; k< K; k++){
            vector<vector<double>> tmpDP(N, vector<double>(N, 0.0));
            for(int x= 0; x< dp.size(); x++){
                for(int y= 0; y< dp[0].size(); y++){
                    for(int d= 0; d< dirs.size(); d++){
                        int r= x+ dirs[d][0];
                        int c= y+ dirs[d][1];
                        if(r< 0 || c< 0 || r>= dp.size() || c>= dp[0].size())
                            continue;
                        tmpDP[r][c]+= dp[x][y];
                    }
                }
            }
            swap(dp, tmpDP);
        }
        double res= 0;
        for(int r= 0; r< N; r++){
            for(int c= 0; c< N; c++){
                res+= dp[r][c];
            }
        }
        
        return res/pow(8, K);
    }
};

time complexity: $O(kn^2)$
space complexity: $O(n^2)$
reference: