dr = [-2, -1, 1, 2, 2, 1, -1, -2] dc = [1, 2, 2, 1, -1, -2, -2, -1] from collections import deque def go(sr, sc): Q = deque() Q.append((sr, sc)) moved = 0 while Q: size = len(Q) for i in range(size): r, c = Q.popleft() if r == er and c == ec: print(moved) return for dir in range(8): nr = r + dr[dir] nc = c + dc[dir] if nr = N or nc >= N or visited[nr][nc]: continue visited[n..