AI/ML - A * Star Algorithm Explained - (A Level Computer Science Made Easy (A2) - 9618)

  Рет қаралды 3,588

ALevelSOS - CS

ALevelSOS - CS

Күн бұрын

Пікірлер: 13
@shreya9540
@shreya9540 7 ай бұрын
thanks sir my friend aanya is now computer engineer now ❤ liked shared commented
@alevelsos
@alevelsos 7 ай бұрын
Reading this made me really happy :D
@nooo7742
@nooo7742 2 жыл бұрын
superb explanation. Thank you
@krumdg1446
@krumdg1446 4 ай бұрын
Great video, I am just confused on how for the g cost on the right and the bottom would be 10 when we previously mentioned that it would be 15 7:40
@alevelsos
@alevelsos 4 ай бұрын
It depends on where you are standing right now imagine you are playing a game and going diagonally costs you 15 vs going straight up/down costs 10. Which is why before just going downwards cost you 10 but from your new position you need to go diagonally and it will cost you 14 now.
@brother-z5e
@brother-z5e 19 күн бұрын
8:42 why is it 15 in one grid and 10 in the other grid
@alevelsos
@alevelsos 19 күн бұрын
It is indicative that the heuristic values and movement cost don't have to be the same (are different in this case).
@YourAverageInternetEnjoyer
@YourAverageInternetEnjoyer 6 ай бұрын
amazing explanation but i hoped u solved the whole grid with us
@alevelsos
@alevelsos 6 ай бұрын
Would make the video too long 😭and there are too many paths that can be taken so it would take even longer. Thanks for watching :3 thou.
@Zecos
@Zecos 4 ай бұрын
You don’t need it for our syllabus ig
@tvfan4168
@tvfan4168 Жыл бұрын
The link in the description doesn’t work
@alevelsos
@alevelsos Жыл бұрын
Solved, thanks for informing.
A Day in the Life of a Harvard Computer Science Student
12:24
John Fish
Рет қаралды 14 МЛН
Dijkstra's Algorithm vs. A* Search vs. Concurrent Dijkstra's Algorithm
4:46
Пришёл к другу на ночёвку 😂
01:00
Cadrol&Fatich
Рет қаралды 11 МЛН
The hidden beauty of the A* algorithm
19:22
Polylog
Рет қаралды 864 М.
SR Flip-Flops Made Easy - A Level Computer Science
16:21
ALevelSOS - CS
Рет қаралды 4,5 М.
A* (A Star) Search Algorithm - Computerphile
14:04
Computerphile
Рет қаралды 1,1 МЛН
Evolving AIs - Predator vs Prey, who will win?
12:15
Pezzza's Work
Рет қаралды 2,9 МЛН
Introduction to Graph Theory: A Computer Science Perspective
16:26
How Hard Candy Is Made | WIRED
13:22
WIRED
Рет қаралды 14 МЛН
A-Level Computer Science (9618) - 15 - Hardware and Virtual Machines
1:38:29
How Dijkstra's Algorithm Works
8:31
Spanning Tree
Рет қаралды 1,3 МЛН
A Comparison of Pathfinding Algorithms
7:54
John Song
Рет қаралды 716 М.