Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
Minimum Knight Moves
Bookmark
BFS
Bidirectional BFS
DFS + Memoization
Input
Target (2,1) - 1 move
Target (1,1) - 2 moves
Target (1,0) - 3 moves
Target (5,5) - 4 moves
Custom
x
=
2
,
y
=
1
queue
Origin
Target
Visited
queue
Origin
Target
Visited
(0,0)
front / rear
queue
Origin
Target
Visited
1
(1,2)
front / rear
queue
Origin
Target
Visited
1
1
1
1
(1,2)
(2,1)
(-1,2)
(-2,1)
front
rear
queue
Origin
Target
Visited
1
1
1
1
1
1
(1,2)
(2,1)
(-1,2)
(-2,1)
(1,-2)
(2,-1)
front
rear
queue
Origin
Target
Visited
1
1
1
1
1
1
1
1
(1,2)
(2,1)
(-1,2)
(-2,1)
(1,-2)
(2,-1)
(-1,-2)
(-2,-1)
front
rear
queue
Origin
Target
Visited
1
1
1
1
1
1
1
1
(2,1)
(-1,2)
(-2,1)
(1,-2)
(2,-1)
(-1,-2)
(-2,-1)
front
rear
queue
Origin
Target
Visited
2
2
2
1
1
1
1
1
1
1
1
(2,1)
(-1,2)
(-2,1)
(1,-2)
(2,-1)
(-1,-2)
(-2,-1)
(2,4)
(3,3)
(0,4)
front
rear
queue
Origin
Target
Visited
2
2
2
2
1
1
1
1
2
1
1
1
1
(2,1)
(-1,2)
(-2,1)
(1,-2)
(2,-1)
(-1,-2)
(-2,-1)
(2,4)
(3,3)
(0,4)
(-1,3)
(2,0)
front
rear
queue
Origin
Target
Visited
2
2
2
2
1
1
1
2
1
2
2
1
1
1
1
(-1,2)
(-2,1)
(1,-2)
(2,-1)
(-1,-2)
(-2,-1)
(2,4)
(3,3)
(0,4)
(-1,3)
(2,0)
+2
front
rear
queue
Origin
Target
Visited
algo
master
.
io
Step:
Start: fewest knight moves from (0, 0) to (2, 1)
0 / 23
Input
Target (2,1) - 1 move
Target (1,1) - 2 moves
Target (1,0) - 3 moves
Target (5,5) - 4 moves
Custom
x
=
2
,
y
=
1
0 / 23
algo
master
.
io
Step:
Start: fewest knight moves from (0, 0) to (2, 1)
