LeetCode 688 Knight Probability in Chessboard - Problem Statement

A knight starts at position $(row, col)$ on an $n \times n$ chessboard. It makes exactly $k$ moves, where each move is chosen uniformly at random from the 8 possible knight moves. The knight might move off the board.

Once off, it stays off. What's the probability that the knight remains on the board after all $k$ moves? Before reading on, think: what should dp track? What's the base case? How do transitions work?