On an n x n chessboard, a knight starts at cell (row, column) and makes exactly k moves. On each move, the knight chooses one of 8 possible moves uniformly at random.

Return the probability that the knight remains on the board after k moves. A knight that goes off the board does not come back.