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.
I understand the algorithm but i don't understand why we used visited array (if its array ofc). I mean yeah, we picked the least cost path to go on always and if we reach a node 2 or more ways, we only accept the cheapest one. I think visited must give us "there is another way with another cost" info and we decide that one of the ways is a dead end right? Is it why we keep visited array ? Great explanation though!
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!
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
My exam is 2 days later. I am from Bangladesh as well. 😂
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.
Me when studying this course 5:45
Amazin explanation though. Great work :D
LMAO
genius
Woww... best explanation I have ever got on UA-cam for search algorithm......
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.
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
watching this on the first day of 2020, thank you for the great explanation!
There are so many videos and confusing. this is the best I could find . Thanks for clear and simple explanation sir.
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.
This is an excellent explanation of the Algorithm. You did a great job here making it simple and clear.
Thank you! Your explanation is clear, this makes the AI course is going to become easier for me.
Clear and straight. No extra articulation. Thanks.
Best explanation ever! I finally understand the visited nodes, active nodes, and dead end!
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
This has to be one of the best videos related to the topic
Explained so clearly and concisely. Thank you so much sir !
clear, crisp and precise . Perfect explanation
You made it really clear ...I loved the way you convey your thoughts on the idea. Thanks a lot
Sincere thanks. You are a good teacher. Hope i pass my exams today
Good and enough explanation 👏🏻👏🏻👏🏻well done
owhhh exactly goooood explanation!! I finally understand how the case of cut over C, B with path cost 9 works. Thank you so much!
Wow, you're so much helpful than my instructor!
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
Best explanation of Uniform Cost Search ever!!
best explanation anyone could ever give!
Thanks very much.
Great explanation. You explained it explicitly. Thanks a lot Sir🙏⚘
WHAT A GOOD EXPLANATION SIR...THANK YOU VERY MUCH SIR..WATCHING FROM INDIA
Thank you for the excellent demonstration!
It's the best explanation I've got thankyou sir!! 😊
Super clear! Thank you very much mister Levine!
Amazing! Thank you Dr. Levine
it was one of the best lecture that i have seen today thanks professor🙌🙌🙌
Is the best explanation on internet. By far!
Good job John !
Keep pushin' P.
Thank you for the video sir! It helped a lot for my AI assignment
You are literally saving my uni life!
Great explanation, you are a good teacher.
That is a genuinely wonderful explanation, Thanks, professor.
Excellent video great explanation. Thank you for this
explained really well and simple.thank uh sir
If multiple nodes have the same lowest cost, which one would you expand first?
Excellent explanation sir, thank you very much.
excellent work , you'r calm explanation really helped me
thanks!
Nice Explanation..Thank you Sir
We also need another list to keep tracking of active nodes with their total costs. Right?
And keeping visited nodes with their total costs.
3 hours till my exam, and I believe I'm gonna do well now. Thanks!
Great presentation! Thank you from Greece
Keep making your videos! You have a clarity of thought to your teaching.
Masuk pak John! penjelasannya manteb betul
Clean explanation. Understood well
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 😄
your explanation is very clear, it's so helpful :) thankyou sir!
Nice and Clear Explanation
not indian: check
clear voice: check
clear example: check
not recorded from a toaster: check
you are the best :)
toaster?
What's the problem with being Indian?
@@akshaybhatia3611 Lmao check out UCS tutorials by Indians, being an Indian I cant understand their language nor their explanation.
And wtf is hinglish???
@@akshaybhatia3611 better to have some "how to speak English correctly" classes before teaching in English!!!
Incredibly easy to understand. Thank you so much!
Awesome Lecture Prof!
You're my superman! Thank you so much sir.
good explanation sir, short and simple..
great explanation
made it clear thanks
Best explanation. Thank you so much
Oh man...that explanation was great!!
Thank you! Glad it was helpful.
thank you for helping me!
A ha your explanation is so clear that i understand it , thank you so much
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.
Really Nice. Prof
Lovely teaching
I have a similar case which way to D costs 8 and to B costs 6. Do I have to choose D first, then B or otherwise?
For anyone that is interested, uniform cost search is the same as branch and bound search.
you have done a great work. Thank you !!!
Beautiful explanation.
Thank you so so much! Saved me heaps of time. Liked & subscribed.
Good explanation, Sir
Very simple and to the point explanation :)
Thank you
Yes great explanation, with good organization. Thank you Sir!
Amazing explanation. Thank you
Thank you so much Sir, The Concept is extremely cleared 🥳❤✊✊
i really like your videos, really good explanations
Could not agree more, literally saving my life
wounderful explanation
Grateful, grateful and grateful
clear and precise explanation. Thank you.
At 4:21, shouldn't we immediatly exclude B(9) from the frontier of nodes? It makes no sense to have both B(8) and B(9) on the priority queue.
at 7:09 would it be fine if we don't add C as a child to B, since we already found a cheaper C in the graph.
Great video
That was REALLY nice!
Wonderful lecture...helped me a lot
Glad you found it useful!
Thanks so much , more blessings
I have A.I test tomorrow and I'm loving the playlist
excellent way of explaining!
What would happen in case where B and C were not uniform (bearing the same total cost)?
I understand the algorithm but i don't understand why we used visited array (if its array ofc). I mean yeah, we picked the least cost path to go on always and if we reach a node 2 or more ways, we only accept the cheapest one. I think visited must give us "there is another way with another cost" info and we decide that one of the ways is a dead end right? Is it why we keep visited array ? Great explanation though!
Sir ..u need more subscribers! u r awsm..i didnt find this level of explanation anywhere. keep it up Sir.
Thank you! Glad you liked it.
Brilliant explanation !
thank you sir, so clear and conceptual lecture.
💯 great explanation... Tx
Excellent explanation. Thanks!
Very nice and helpful video sir