knight_distance.py

from collections import deque

SIZE = 8

def knight_distance(i: int, j: int) -> list[list[int]]:
    board = [[None] * SIZE for _ in range(SIZE)]
    q = deque([(i, j, 0)])
    while q:
        (i, j, d) = q.popleft()
        if not 0 <= i < SIZE or not 0 <= j < SIZE or board[i][j] is not None:
            continue
        board[i][j] = d
        q.extend(
            (i+two, j+one, d+1) if vertical else (i+one, j+two, d+1)
            for one in [1, -1]
            for two in [2, -2]
            for vertical in [True, False]
        )
    return board

if __name__ == '__main__':
    for row in knight_moves(3,4):
        print(" ".join(str(c) for c in row))