Learn
Practice
Interview
Resources
Newsletter
F
Toggle theme
0
F
0
Toggle menu
Animations
← Back to All Animations
A* Search Algorithm
Bookmark
Input
6x6 Grid
8x8 Grid
Simple 4x4
Custom
rows
=
6
,
cols
=
6
,
start
=
[0, 0]
,
end
=
[5, 5]
,
obstacles
=
[[1,1],[1,2],[2,1],[3,3],[4,3]]
A* Search (6x6 Grid)
0
1
2
3
4
5
0
1
2
3
4
5
S
X
X
X
X
X
E
Unvisited
Open Set
Closed Set
Path
Obstacle
A* Search (6x6 Grid)
0
1
2
3
4
5
0
1
2
3
4
5
S
X
X
X
X
X
E
Unvisited
Open Set
Closed Set
Path
Obstacle
A* Search (6x6 Grid)
0
1
2
3
4
5
0
1
2
3
4
5
S
1
1
X
X
2
X
X
X
E
Unvisited
Open Set
Closed Set
Path
Obstacle
A* Search (6x6 Grid)
0
1
2
3
4
5
0
1
2
3
4
5
S
1
2
3
1
X
X
2
X
3
X
4
X
E
Unvisited
Open Set
Closed Set
Path
Obstacle
A* Search (6x6 Grid)
0
1
2
3
4
5
0
1
2
3
4
5
S
1
2
3
4
1
X
X
4
2
X
3
4
X
4
5
X
5
E
Unvisited
Open Set
Closed Set
Path
Obstacle
A* Search (6x6 Grid)
0
1
2
3
4
5
0
1
2
3
4
5
S
1
2
3
4
5
1
X
X
4
5
2
X
5
3
4
5
X
4
5
X
5
E
Unvisited
Open Set
Closed Set
Path
Obstacle
A* Search (6x6 Grid)
0
1
2
3
4
5
0
1
2
3
4
5
S
1
2
3
4
5
1
X
X
4
5
2
X
6
5
3
4
5
X
4
5
6
X
5
6
E
Unvisited
Open Set
Closed Set
Path
Obstacle
A* Search (6x6 Grid)
0
1
2
3
4
5
0
1
2
3
4
5
S
1
2
3
4
5
1
X
X
4
5
6
2
X
6
5
6
3
4
5
X
4
5
6
X
5
6
7
E
Unvisited
Open Set
Closed Set
Path
Obstacle
A* Search (6x6 Grid)
0
1
2
3
4
5
0
1
2
3
4
5
S
1
2
3
4
5
1
X
X
4
5
6
2
X
6
5
6
7
3
4
5
X
7
4
5
6
X
5
6
7
8
E
Unvisited
Open Set
Closed Set
Path
Obstacle
A* Search (6x6 Grid)
0
1
2
3
4
5
0
1
2
3
4
5
S
1
2
3
4
5
1
X
X
4
5
6
2
X
6
5
6
7
3
4
5
X
7
8
4
5
6
X
8
9
5
6
7
8
9
E
Unvisited
Open Set
Closed Set
Path
Obstacle
A* Search (6x6 Grid)
0
1
2
3
4
5
0
1
2
3
4
5
S
1
2
3
4
5
1
X
X
4
5
6
2
X
6
5
6
7
3
4
5
X
7
8
4
5
6
X
8
9
5
6
7
8
9
E
Unvisited
Open Set
Closed Set
Path
Obstacle
algo
master
.
io
Step:
Start: A* Search from S to E using Manhattan distance heuristic
0 / 63
Input
6x6 Grid
8x8 Grid
Simple 4x4
Custom
rows
=
6
,
cols
=
6
,
start
=
[0, 0]
,
end
=
[5, 5]
,
obstacles
=
[[1,1],[1,2],[2,1],[3,3],[4,3]]
0 / 63
algo
master
.
io
Step:
Start: A* Search from S to E using Manhattan distance heuristic
