Formatted question description: https://leetcode.ca/all/688.html
688. Knight Probability in Chessboard (Medium)
On an N
xN
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 topleft square is (0, 0)
, and the bottomright square is (N1, N1)
.
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.
Companies: Goldman Sachs, Facebook
Related Topics: Dynamic Programming
Similar Questions:
Solution 1. DP
Denote the result as F(N, K, r, c)
.
For K = 0
:
F(N, K, r, c) = 1 If (r, c) is on board.
0 otherwise.
For K > 0
:
F(N, K, r, c) = Sum(F(N, K  1, x, y)) / 8 where (x, y) are all the points reachable from (r, c)
We can use this recurrence relation to solve the problem.
// OJ: https://leetcode.com/problems/knightprobabilityinchessboard/
// Time: O(KN^2)
// Space: O(N^2)
class Solution {
private:
int dirs[8][2] = { {2,1}, {1,2}, {1,2}, {2,1}, {2,1}, {1,2}, {1,2}, {2,1} };
public:
double knightProbability(int N, int K, int r, int c) {
vector<vector<double>> m(N, vector<double>(N, 1));
while (K > 0) {
vector<vector<double>> next(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;
next[i][j] += m[x][y];
}
next[i][j] /= 8;
}
}
m = next;
}
return m[r][c];
}
};
Java

class Solution { public double knightProbability(int N, int K, int r, int c) { double[][] probabilities = new double[N][N]; probabilities[r][c] = 1; int[][] directions = { {2, 1}, {2, 1}, {1, 2}, {1, 2}, {2, 1}, {2, 1}, {1, 2}, {1, 2} }; for (int i = 0; i < K; i++) { double[][] curProbabilities = new double[N][N]; for (int j = 0; j < N; j++) { for (int k = 0; k < N; k++) { int row = j, column = k; double probability = probabilities[j][k] / 8; if (probability > 0) { for (int[] direction : directions) { int newRow = row + direction[0], newColumn = column + direction[1]; if (newRow >= 0 && newRow < N && newColumn >= 0 && newColumn < N) curProbabilities[newRow][newColumn] += probability; } } } } for (int j = 0; j < N; j++) { for (int k = 0; k < N; k++) probabilities[j][k] = curProbabilities[j][k]; } } double totalProbability = 0; for (int i = 0; i < N; i++) { for (int j = 0; j < N; j++) totalProbability += probabilities[i][j]; } return totalProbability; } }

// OJ: https://leetcode.com/problems/knightprobabilityinchessboard/ // Time: O(KN^2) // Space: O(N^2) class Solution { private: int dirs[8][2] = { {2,1}, {1,2}, {1,2}, {2,1}, {2,1}, {1,2}, {1,2}, {2,1} }; public: double knightProbability(int N, int K, int r, int c) { vector<vector<double>> m(N, vector<double>(N, 1)); while (K > 0) { vector<vector<double>> next(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; next[i][j] += m[x][y]; } next[i][j] /= 8; } } m = next; } return m[r][c]; } };

class Solution(object): def knightProbability(self, N, K, r, c): """ :type N: int :type K: int :type r: int :type c: int :rtype: float """ dp = [[0 for i in range(N)] for j in range(N)] dp[r][c] = 1 directions = [(1, 2), (1, 2), (2, 1), (2, 1), (2, 1), (2, 1), (1, 2), (1, 2)] for k in range(K): new_dp = [[0 for i in range(N)] for j in range(N)] for i in range(N): for j in range(N): for d in directions: x, y = i + d[0], j + d[1] if x < 0 or x >= N or y < 0 or y >= N: continue new_dp[i][j] += dp[x][y] dp = new_dp return sum(map(sum, dp)) / float(8 ** K)