688. Knight Probability in Chessboard Medium

1/**
2 * [688] Knight Probability in Chessboard
3 *
4 * On an n x n chessboard, a knight starts at the cell (row, column) and attempts to make exactly k moves. The rows and columns are 0-indexed, so the top-left cell is (0, 0), and the bottom-right cell is (n - 1, n - 1).
5 * A chess knight has eight possible moves it can make, as illustrated below. Each move is two cells in a cardinal direction, then one cell in an orthogonal direction.
6 * <img src="https://assets.leetcode.com/uploads/2018/10/12/knight.png" style="width: 300px; height: 300px;" />
7 * 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.
8 * The knight continues moving until it has made exactly k moves or has moved off the chessboard.
9 * Return the probability that the knight remains on the board after it has stopped moving.
10 *  
11 * Example 1:
12 * 
13 * Input: n = 3, k = 2, row = 0, column = 0
14 * Output: 0.06250
15 * Explanation: There are two moves (to (1,2), (2,1)) that will keep the knight on the board.
16 * From each of those positions, there are also two moves that will keep the knight on the board.
17 * The total probability the knight stays on the board is 0.0625.
18 * 
19 * Example 2:
20 * 
21 * Input: n = 1, k = 0, row = 0, column = 0
22 * Output: 1.00000
23 * 
24 *  
25 * Constraints:
26 * 
27 * 	1 <= n <= 25
28 * 	0 <= k <= 100
29 * 	0 <= row, column <= n - 1
30 * 
31 */
32pub struct Solution {}
33
34// problem: https://leetcode.com/problems/knight-probability-in-chessboard/
35// discuss: https://leetcode.com/problems/knight-probability-in-chessboard/discuss/?currentPage=1&orderBy=most_votes&query=
36
37// submission codes start here
38
39impl Solution {
40    pub fn knight_probability(n: i32, k: i32, row: i32, column: i32) -> f64 {
41        0f64
42    }
43}
44
45// submission codes end
46
47#[cfg(test)]
48mod tests {
49    use super::*;
50
51    #[test]
52    fn test_688() {
53    }
54}
55