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 Kmoves. 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.

问题分析：

我们首先想到的是动态规划求解该类问题。我们设置状态转移数组dp,dp[i][j]表示某一次移动后该骑士还留在棋盘上可能的情况数目，后一次移动就等于前一次移动的可能性数目之和。

过程详见代码：

class Solution {
public:
    double knightProbability(int N, int K, int r, int c) {
		int moves[8][2] = { { 1, 2 }, { 1, -2 }, { 2, 1 }, { 2, -1 }, { -1, 2 }, { -1, -2 }, { -2, 1 }, { -2, -1 } };
		int len = N;
		vector<vector<double>> dp(len, vector<double>(len, 1));
		for (int l = 0; l < K; l++)
		{
			vector<vector<double>> dpt(len, vector<double>(len, 0));
			for (int i = 0; i < len; i++)
			{
				for (int j = 0; j < len; j++)
				{
					for (auto move : moves)
					{
						int row = i + move[0];
						int col = j + move[1];
						if (isLegal(row, col, len)) dpt[i][j] += dp[row][col];
					}
				}
			}
			dp = dpt;
		}
		return dp[r][c] / pow(8, K);
	}
	bool isLegal(int r, int c, int len) {
		return r >= 0 && r < len && c >= 0 && c < len;
	}
};