Ratsun reitit

def recurse_knight(board, pos, depth):
    # All possible knight moves from origin
    moves = [
        (-2,-1),
        (-1,-2),
        (1,-2),
        (2, -1),
        (2,1),
        (1,2),
        (-1,2),
        (-2,1),
    ]
    moves = list(filter(
        # Filter out moves out of bounds
        lambda t: 0 <= t[0] < len(board) and  0 <= t[1] < len(board[1]),
        map(
            # Find all moves from pos
            lambda t: (t[0]+pos[0], t[1]+pos[1]),
            moves
        )
    ))
    done = []
    for move in moves:
        # Perform every move which reaches a new tile
        if board[move[0]][move[1]] is None or board[move[0]][move[1]] > depth:
            board[move[0]][move[1]] = depth
            done += [move]
    for move in done:
        # Recurse for each newly done move
        recurse_knight(board, move, depth+1)

def pretty_print_matrix(m):
    return "\n".join(map(lambda x:" ".join(map(str,x)), m))

board = []
n = int(input())
for x in range(n):
    board += [[]]
    for y in range(n):
        board[-1] += [None]

board[0][0] = 0;
recurse_knight(board,(0,0),1);
print(
    pretty_print_matrix(board)
)

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

Test 8

Group: 2, 3

Verdict: ACCEPTED

Test 9

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 10

Group: 2, 3

Verdict: TIME LIMIT EXCEEDED

Test 11

Group: 3

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 43, in <module>
    recurs...

Test 12

Group: 3

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 43, in <module>
    recurs...

Test 13

Group: 3

Verdict: RUNTIME ERROR

Traceback (most recent call last):
  File "input/code.py", line 43, in <module>
    recurs...