First three visited nodes: SAD 😄 Joke aside, this channel deserves more subscribers and views. Best explanation ever I have seen since I started to learn about search problem. Thank you, Mr. Lavine. Please carry on doing more of those. Best wishes.
Thank you! Wouldn't it be clearer though if you mentioned the frontier concept and distinguished between nodes and states? Using Norvig & Russell terminology I think what you call 'Visited' is your explored states set although you use the term nodes on it sometimes. This way, you could have eliminated B(9) early on based on the frontier content and show that not revisiting node S was because of the explored states set content.
Great explanation, thank you so much ! I have a question? If i use kruskal algorithm (MST) Than Calculate The Cost ,, Than I am getting the Minimum Cost ?
Great explanation. Just an additional thought, if this method is contrasted with a sorted merge for a BFS(Breadth First Search), this would have been more intuitive.
FINALLY, A great explanation. Thank you so much. With this, the AI course is going to become easier 🙏🏻
A very clear and simple explanation! You also covered a lot of edge cases with this rather complex graph, so I really liked that!
Great explanation, thank you so much !
You're very welcome!
Thanks John! Great explanation - our lectures didn't cover this well and I needed it for my AI exam.
You are an incredible teacher,Sir...elegantly taught...Hatsoff...seriously
I feel grateful after finding this treasure by chance! I am going to go through all the videos to tamp my algorithm knowledge.
watching this on the first day of 2020, thank you for the great explanation!
This is an excellent explanation of the Algorithm. You did a great job here making it simple and clear.
You made it really clear ...I loved the way you convey your thoughts on the idea. Thanks a lot
First three visited nodes: SAD 😄
Joke aside, this channel deserves more subscribers and views. Best explanation ever I have seen since I started to learn about search problem. Thank you, Mr. Lavine. Please carry on doing more of those. Best wishes.
tomorrow is my final exam and after watching all your videos on search algorithm, my concept is full clear. Thank you Love from BANGLADESH
same
Best explanation ever! I finally understand the visited nodes, active nodes, and dead end!
There are so many videos and confusing. this is the best I could find . Thanks for clear and simple explanation sir.
Sincere thanks. You are a good teacher. Hope i pass my exams today
If it wasn't for you, I would've long kissed my Computer Science degree goodbye, so thank you, sir, for your simple but yet amazing explanations
This has to be one of the best videos related to the topic
That is a genuinely wonderful explanation, Thanks, professor.
Woww... best explanation I have ever got on TH-cam for search algorithm......
Wow, you're so much helpful than my instructor!
Explained so clearly and concisely. Thank you so much sir !
Clear and straight. No extra articulation. Thanks.
best explanation anyone could ever give!
Thanks very much.
Excellent video great explanation. Thank you for this
Amazing! Thank you Dr. Levine
Great explanation. You explained it explicitly. Thanks a lot Sir🙏⚘
Good job John !
Keep pushin' P.
owhhh exactly goooood explanation!! I finally understand how the case of cut over C, B with path cost 9 works. Thank you so much!
Good and enough explanation 👏🏻👏🏻👏🏻well done
Great explanation, you are a good teacher.
Thank you for the video sir! It helped a lot for my AI assignment
it was one of the best lecture that i have seen today thanks professor🙌🙌🙌
I’ve a world famous professor of AI who is considered to be a major innovator in the field. Yet still, your explanation is so superior it is absurd
Nice explanation !!
You are literally saving my uni life!
wounderful explanation
Nice Explanation..Thank you Sir
Great presentation! Thank you from Greece
Beautiful explanation.
Yes great explanation, with good organization. Thank you Sir!
Thanks so much , more blessings
great explanation
made it clear thanks
Keep making your videos! You have a clarity of thought to your teaching.
Me when studying this course 5:45
Amazin explanation though. Great work :D
LMAO
genius
You deserve a sub man keep up the good work ❤❤
Nice and Clear Explanation
Great explanation
explained really well and simple.thank uh sir
Excellent explanation sir, thank you very much.
Incredibly easy to understand. Thank you so much!
Really Nice. Prof
excellent work , you'r calm explanation really helped me
thanks!
Best explanation of Uniform Cost Search ever!!
great explanation
Best explanation. Thank you so much
It's the best explanation I've got thankyou sir!! 😊
Thank you so so much! Saved me heaps of time. Liked & subscribed.
I love the way you are writing "G"
Thanks for the explanation.
CJ: *_,,Gee, thanks G."_*
(Mission: Drive-by,
Grand Theft Auto: San Andreas, 2005)
@@matrixmirage2148 *2004
Very simple and to the point explanation :)
Thank you
I like your explanation, thank you for your performance.
3 hours till my exam, and I believe I'm gonna do well now. Thanks!
You're my superman! Thank you so much sir.
Thank you! Wouldn't it be clearer though if you mentioned the frontier concept and distinguished between nodes and states?
Using Norvig & Russell terminology I think what you call 'Visited' is your explored states set although you use the term nodes on it sometimes.
This way, you could have eliminated B(9) early on based on the frontier content and show that not revisiting node S was because of the explored states set content.
Great explanation, thank you so much !
I have a question?
If i use kruskal algorithm (MST) Than Calculate The Cost ,, Than I am getting the Minimum Cost ?
good explanation sir, short and simple..
your explanation is very clear, it's so helpful :) thankyou sir!
Good explanation, Sir
Great video
Best explanation ❤
Sir your explanation is so well ,thank you sir
I wish my subjects teachers can explain concepts in this way,so I become topper in university 😄
Great explanation!
Tq sir🙏
Is the best explanation on internet. By far!
you have done a great work. Thank you !!!
great explanation 💯
Great explanation,
We also need another list to keep tracking of active nodes with their total costs. Right?
And keeping visited nodes with their total costs.
Thanks, excellent explanation
Clean explanation. Understood well
Masuk pak John! penjelasannya manteb betul
If multiple nodes have the same lowest cost, which one would you expand first?
Very very well explained ! Thank you 🙏🏻
Amazing explanation. Thank you
Brilliant explanation !
💯 great explanation... Tx
Lovely teaching
amazing explanation
Grateful, grateful and grateful
Well explained! Add more content brother! You deserve a sub
excellent way of explaining!
you're amazing. it''s so hard to find information about this
Great Explanation sir, thanks a lot !!
Thank you, good explanation
thank you sir, so clear and conceptual lecture.
hey great video! i love your explanations, so clear and simple. please make more!!!
Great explanation. Just an additional thought, if this method is contrasted with a sorted merge for a BFS(Breadth First Search), this would have been more intuitive.
level sir ❣
Very good video Prof. Please can you do a video on Greedy search
Excellent explanation. Thanks!
woow, it's so simple explanation .. thank you so much !:)
clear and precise explanation. Thank you.
Thank you sir, God bless.