# 688. Knight Probability in Chessboard

On an `N`x`N` 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.

``````class Solution {
public:
double knightProbability(int N, int K, int r, int c) {
if (K == 0) return 1;
vector<vector<double>> dp(N, vector<double>(N, 1));
vector<vector<int>> dirs{{-1,-2},{-2,-1},{-2,1},{-1,2},{1,2},{2,1},{2,-1},{1,-2}};
for (int m = 0; m < K; ++m) {
vector<vector<double>> t(N, vector<double>(N, 0));
for (int i = 0; i < N; ++i) {
for (int j = 0; j < N; ++j) {
for (auto dir : dirs) {
int x = i + dir[0], y = j + dir[1];
if (x < 0 || x >= N || y < 0 || y >= N) continue;
t[i][j] += dp[x][y];
}
}
}
dp = t;
}
return dp[r][c] / pow(8, K);
}
};
``````

``````class Solution {
public:
vector<vector<int>> dirs{{-1,-2},{-2,-1},{-2,1},{-1,2},{1,2},{2,1},{2,-1},{1,-2}};
double knightProbability(int N, int K, int r, int c) {
vector<vector<vector<double>>> memo(K + 1, vector<vector<double>>(N, vector<double>(N, 0.0)));
return helper(memo, N, K, r, c) / pow(8, K);
}
double helper(vector<vector<vector<double>>>& memo, int N, int k, int r, int c) {
if (k == 0) return 1.0;
if (memo[k][r][c] != 0.0) return memo[k][r][c];
for (auto dir : dirs) {
int x = r + dir[0], y = c + dir[1];
if (x < 0 || x >= N || y < 0 || y >= N) continue;
memo[k][r][c] += helper(memo, N, k - 1, x, y);
}
return memo[k][r][c];
}
};
``````

Out of Boundary Paths

https://discuss.leetcode.com/topic/105571/my-accepted-dp-solution

https://discuss.leetcode.com/topic/105597/c-java-dp-concise-solution

LeetCode All in One 题目讲解汇总(持续更新中…)

 微信打赏 Venmo 打赏
（欢迎加入博主的知识星球，博主将及时答疑解惑，并分享刷题经验与总结，试运营期间前五十位可享受半价优惠～）

×

Help us with donation