标签：dp0 int Knight Chessboard ++ 688 knight moves board

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: DP. [C++]

class Solution {
public:
    double knightProbability(int N, int K, int r, int c) {
        vector<vector<double>> dp0(N, vector<double>(N, 0.0));
        dp0[r][c] = 1.0;
        int dirs[8][2] = {{-1, -2}, {-2, -1}, {1, -2}, {2, -1},
                          {-2, 1}, {-1, 2}, {1, 2}, {2, 1}};
        
        for (int k = 1; k <= K; ++k) {
            vector<vector<double>> dp1(N, vector<double>(N, 0.0));
            for (int i = 0; i < N; ++i) {
                for (int j = 0; j < N; ++j) {
                    for (int r = 0; r < 8; ++r) {
                        int x = j + dirs[r][0];
                        int y = i + dirs[r][1];
                        if (x < 0 || y < 0 || x >= N || y >= N) continue;
                        dp1[i][j] += dp0[y][x];
                    }
                }
            }
            
            swap(dp0, dp1);
        }
        
        double total = 0;
        for (int i = 0; i < N; ++i) {
            for (int j = 0; j < N; ++j) {
                total += dp0[i][j];
            }
        }
        
        return total / pow(8, K);
    }
};

Analysis:

http://zxi.mytechroad.com/blog/dynamic-programming/688-knight-probability-in-chessboard/

标签：dp0,int,Knight,Chessboard,++,688,knight,moves,board
来源： https://www.cnblogs.com/ruruozhenhao/p/10522497.html

本站声明： 1. iCode9 技术分享网（下文简称本站）提供的所有内容，仅供技术学习、探讨和分享；
2. 关于本站的所有留言、评论、转载及引用，纯属内容发起人的个人观点，与本站观点和立场无关；
3. 关于本站的所有言论和文字，纯属内容发起人的个人观点，与本站观点和立场无关；
4. 本站文章均是网友提供，不完全保证技术分享内容的完整性、准确性、时效性、风险性和版权归属；如您发现该文章侵犯了您的权益，可联系我们第一时间进行删除；
5. 本站为非盈利性的个人网站，所有内容不会用来进行牟利，也不会利用任何形式的广告来间接获益，纯粹是为了广大技术爱好者提供技术内容和技术思想的分享性交流网站。