[WXM] LeetCode 688. Knight Probability in Chessboard C++

688. Knight Probability in Chessboard

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.

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.

Approach

1. 题目大意就是外国象棋中骑士在棋盘某个位置，然后移动K次能留在棋盘上的概率是多少。这里我采用通俗易懂的记忆化搜索，我们用cache[k][c][r]标记骑士在移动第K次，位置在（c，r）时的状态，然后我们就直接搜索它的八种走法即可，然后边界就是出界和移动次数已用完，剩余看代码加深理解。

Code

class Solution {
public:
    double DFS(int N,int K,int r,int c, vector<vector<vector<double>>>&cache) {
        if (r < 0 || c < 0 || r >= N || c >= N) {
            return 0;
        }
        if (K == 0) {
            return 1;
        }
        if (cache[K][r][c] != -1)return cache[K][r][c];
        cache[K][r][c]=DFS(N, K - 1, r + 1, c + 2, cache)+
        DFS(N, K - 1, r + 2, c + 1, cache)+
        DFS(N, K - 1, r - 1, c + 2, cache)+
        DFS(N, K - 1, r - 2, c + 1, cache)+
        DFS(N, K - 1, r - 1, c - 2, cache)+
        DFS(N, K - 1, r - 2, c - 1, cache)+
        DFS(N, K - 1, r + 1, c - 2, cache)+
        DFS(N, K - 1, r + 2, c - 1, cache);
        return cache[K][r][c];
    }
    double knightProbability(int N, int K, int r, int c) {
        vector<vector<vector<double>>>cache(K+1, vector<vector<double>>(N, vector<double>(N, -1)));
        return DFS(N, K, r, c, cache) /pow(8, K);
    }
};