Ratsun reitit

class Point: 
    def __init__(self, x = 0, y = 0, dist = 0): 
        self.x = x 
        self.y = y 
        self.d = dist


dxs = [2, 2, -2, -2, 1, 1, -1, -1]
dys = [1, -1, 1, -1, 2, -2, 2, -2]

n = int(input())

toVisit = [Point(0, 0, 0)]
visited = [[False for _ in range(n)] for _ in range(n)]
result = [[-1 for _ in range(n)] for _ in range(n)]


def BFS(n):
    visited[0][0] = True
       
    while toVisit:
        p = toVisit.pop(0)
        result[p.y][p.x] = p.d
              
        for dx, dy in zip(dxs, dys):
            x = p.x + dx
            y = p.y + dy
              
            if 0 <= x < n and 0 <= y < n and not visited[y][x]:
                visited[y][x] = True
                toVisit.append(Point(x, y, p.d + 1))

    return result


for row in BFS(n):
    print(" ".join(map(str, row)))

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: ACCEPTED

Test 10

Group: 2, 3

Verdict: ACCEPTED

Test 11

Group: 3

Verdict: ACCEPTED

Test 12

Group: 3

Verdict: ACCEPTED

Test 13

Group: 3

Verdict: ACCEPTED