zoukankan      html  css  js  c++  java
  • 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: 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/

    永远渴望,大智若愚(stay hungry, stay foolish)
  • 相关阅读:
    java encoding
    [转]shell 变量的作用域
    [转] shell :解析json的命令-jq
    [转] Linux user-space Atomic Operations && GCC Atomic builtins
    [转]reference counting
    [转]memory order,memory barrier,原子操作
    [转]c语言volatile 关键字
    OCF介绍
    [转]计算机存储 cache介绍
    [转] linux IO
  • 原文地址:https://www.cnblogs.com/h-hkai/p/10522497.html
Copyright © 2011-2022 走看看