Thank you so much ! The explanations are very clear, you make it sound like it's easy! What's with the human calculator by the way ?

Thankyou sir

Still useful in 2024❤

Think you sir but where is limited search?

Great explanation

Perfect!

Thanks John. This video is a lifesaver. BTW, I've a question. Say I want to drive to the nearest city, and he wants to choose between 3 cities on a map (i.e. 3 goals states/nodes). So does this mean I have to calculate the A* score of each goal state, and then choose the smallest one? Thanks!

Thank you

Super clear! Thank you very much mister Levine!

John levine and josh starmer are carrying me so hard my feet aren't even touching the ground

Amazing!!

Umar noman zinda bad

this guy is kinda sick with it

bro is saving my ai course fr i love you Mr Levine

Your videos help me so much with my course, thanks!

You are a gifted teacher! Thank you!

WATCHING FROM PKMKB

WHAT A GOOD EXPLANATION SIR...THANK YOU VERY MUCH SIR..WATCHING FROM INDIA

WATCHING FROM NIT SRINAGAR,JAMMU AND KASHMIR,INIDA

You are the best profesor ever

Thank you, best explanation! Wish I had watched your videos before

Got nothing 😂

Thank you Sir!

crystal clear explanation sir!!

error 404

Thank you!!

Very well explained. Great! Comments: There is no mention of the queue that supports the search and the size issue associated with it and how it works. Why use a new term "visited" and not just stay with "expanded"?

amazing walkthrough, thank you

@johnLevine Kindly share assessment problem as well with accurate heuristics.

I love how you keep it simple, teaching only what we need to know because it helps me from getting overwhelmed. One video on the subject from you and I'm able to break down and solve more complex problems.

Great explanation!

High clarity of concept!!!

Great 😍😍😍 thank you

Beautifully explained

What would be a real life example ?. For example, when robo vacuum is trying to clean a house, what would be the example of pruning here ?. Is pruning happening when robo vacuum for example when it says task finish although it's not like skipping task because there are an obstacles blocking its way?

Is there goal state for bfs nd dfs

Goated

great explanation

Thank you for this. I understand a bit more!

Beautiful explanation.

Where do we get the heuristics from?

excellente!!! mi amo probes !!

Thanks for helping again!!!

thank you for helping me!

my goat

I'm not able to understand in which order he is exploring the node, if there is no order then after exploring A we can explore G1,B then the algo stop at G1 itself, that is the path will be S -> A -> G1

*Modified DFS with a bound. You only continue going down the tree to nodes that take d or less steps to get to. Thanks for the video!

John Levine, you audacious remarkable cunt. Your boldness knows no bounds. Your pedagogical skills are that of a seasoned mentor, effortlessly transmuting the intricate language of algorithms into pure comprehension.

Explained so clearly and concisely. Thank you so much sir !

Thanks for one of the best explanations I heard!