Knight's Minimum Moves

Medium BFS on Grids (Variants)

Log in to solve

On an n x n chessboard print the minimum number of knight moves from (r1,c1) to (r2,c2), 0-indexed.

Constraints

1 <= n <= 1000

No discussions yet.