Knight Probability in Chessboard

Given an n×n board and a starting cell, compute the probability a knight that chooses each of its eight moves uniformly at random stays on the board after exactly k moves; the core challenge is efficiently aggregating k-step transition probabilities (typically via DP or memoized recursion) for n ≤ 25 and k ≤ 100.