Ratsun reitit

n = int(input())
shortestpath = {}
 
for i in range(n):
    for j in range(n):
        shortestpath[(i, j)] = 999999
 
start = (0, 0)
shortestpath[start] = 0
 
length = 0
 
def getneighbours(node):
    neighbours = []
    
    offsets = ((1, 2), (2, 1), (-1, 2), (2, -1), (-1, -2), (-2, -1), (1, -2), (-2, 1))
    
    for i in range(8):
        newnode = (node[0]+offsets[i][0], node[1]+offsets[i][1])
        
        if 0 <= newnode[0] < n and 0 <= newnode[1] < n:
            neighbours.append(newnode)
    
    return neighbours
    
def visit(node, length):
    length += 1
    neighbours = getneighbours(node)
    
    for newnode in neighbours:
        if length < shortestpath[newnode]:
            shortestpath[newnode] = length
            
            visit(newnode, length)
            
#print(getneighbours((2,2)))
visit(start, length)
#print(shortestpath)
 
 
for r in range(n):
    row = ""
    for c in range(n):
        row += f"{shortestpath[(r, c)]} "
    
    print(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: RUNTIME ERROR

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

Test 10

Group: 2, 3

Verdict: RUNTIME ERROR

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

Test 11

Group: 3

Verdict: RUNTIME ERROR

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

Test 12

Group: 3

Verdict: RUNTIME ERROR

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

Test 13

Group: 3

Verdict: RUNTIME ERROR

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