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.
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!
Brilliant explanation! Thank you. Question: the algorithm terminated because you had reached all possible goal states, and then you picked the path with lowest cost, correct? So you must reach all possible goal states .
Nooo , This algorithm finish when you successfully reach a Goal vertex/node in respecting the constraint of exploring the minimal path in matter of cost . (My explanation is not clear, sorry But you travel the tree following the methodology of minimizing travelling costs at each steps and not reexploring the already visited vertexes/nodes , and by doing so if you encounter a Goal node/vertex, the algorithm successfully end. Otherwise it continues. )
Hello, I have a weighted and undirected graph using uniform-cost search. The initial steps given to me was to repeatedly traverse all nodes until the destination is found, can I really use uniform-cost search for this or it needs a different method?
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!
Thanks John! Great explanation - our lectures didn't cover this well and I needed it for my AI exam.
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. 😂
Me when studying this course 5:45
Amazin explanation though. Great work :D
LMAO
genius
Great explanation, thank you so much !
You're very welcome!
watching this on the first day of 2020, thank you for the great explanation!
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
There are so many videos and confusing. this is the best I could find . Thanks for clear and simple explanation sir.
Woww... best explanation I have ever got on RUclips for search algorithm......
You are an incredible teacher,Sir...elegantly taught...Hatsoff...seriously
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! Your explanation is clear, this makes the AI course is going to become easier for me.
This is an excellent explanation of the Algorithm. You did a great job here making it simple and clear.
owhhh exactly goooood explanation!! I finally understand how the case of cut over C, B with path cost 9 works. Thank you so much!
Sincere thanks. You are a good teacher. Hope i pass my exams today
Wow, you're so much helpful than my instructor!
This has to be one of the best videos related to the topic
You made it really clear ...I loved the way you convey your thoughts on the idea. Thanks a lot
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
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
Explained so clearly and concisely. Thank you so much sir !
Best explanation ever! I finally understand the visited nodes, active nodes, and dead end!
It's the best explanation I've got thankyou sir!! 😊
thank you for your great explanation.
best explanation anyone could ever give!
Thanks very much.
WHAT A GOOD EXPLANATION SIR...THANK YOU VERY MUCH SIR..WATCHING FROM INDIA
Clear and straight. No extra articulation. Thanks.
3 hours till my exam, and I believe I'm gonna do well now. Thanks!
it was one of the best lecture that i have seen today thanks professor🙌🙌🙌
Thank you for the video sir! It helped a lot for my AI assignment
clear, crisp and precise . Perfect explanation
Good and enough explanation 👏🏻👏🏻👏🏻well done
Great explanation. You explained it explicitly. Thanks a lot Sir🙏⚘
Best explanation of Uniform Cost Search ever!!
That is a genuinely wonderful explanation, Thanks, professor.
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 😄
You are literally saving my uni life!
Thank you for the excellent demonstration!
excellent work , you'r calm explanation really helped me
thanks!
Is the best explanation on internet. By far!
your explanation is very clear, it's so helpful :) thankyou sir!
Excellent explanation sir, thank you very much.
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.
You deserve a sub man keep up the good work ❤❤
Super clear! Thank you very much mister Levine!
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 explanation, you are a good teacher.
Awesome Lecture Prof!
If multiple nodes have the same lowest cost, which one would you expand first?
Excellent video great explanation. Thank you for this
For anyone that is interested, uniform cost search is the same as branch and bound search.
Incredibly easy to understand. Thank you so much!
explained really well and simple.thank uh sir
Very good video Prof. Please can you do a video on Greedy search
thank you for helping me!
Good job John !
Keep pushin' P.
A ha your explanation is so clear that i understand it , thank you so much
We also need another list to keep tracking of active nodes with their total costs. Right?
And keeping visited nodes with their total costs.
Amazing! Thank you Dr. Levine
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?
Thank you so so much! Saved me heaps of time. Liked & subscribed.
great explanation
made it clear thanks
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!!!
Keep making your videos! You have a clarity of thought to your teaching.
I have A.I test tomorrow and I'm loving the playlist
Clean explanation. Understood well
you saved my life man thanks for the video i got a bad doc
Thanks! Glad you found it useful.
Best explanation. Thank you so much
Thank you so much Sir, The Concept is extremely cleared 🥳❤✊✊
Came here just for the British accent :p .. nicely explained!
Great presentation! Thank you from Greece
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!
You're my superman! Thank you so much sir.
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.
Nice and Clear Explanation
What if the node has already been visited and we get a path where the distance to that node is lesser ?
Very simple and to the point explanation :)
Thank you
What would happen in case where B and C were not uniform (bearing the same total cost)?
Great explanation!
Tq sir🙏
Nice Explanation..Thank you Sir
Oh man...that explanation was great!!
Thank you! Glad it was helpful.
Is it guaranteed that it will always expand all nodes from the graph?
you're amazing. it''s so hard to find information about this
Well explained! Add more content brother! You deserve a sub
i really like your videos, really good explanations
Could not agree more, literally saving my life
Great video
Best explanation ❤
Yes great explanation, with good organization. Thank you Sir!
Brilliant explanation! Thank you.
Question: the algorithm terminated because you had reached all possible goal states, and then you picked the path with lowest cost, correct? So you must reach all possible goal states .
Nooo , This algorithm finish when you successfully reach a Goal vertex/node in respecting the constraint of exploring the minimal path in matter of cost .
(My explanation is not clear, sorry
But you travel the tree following the methodology of minimizing travelling costs at each steps and not reexploring the already visited vertexes/nodes , and by doing so if you encounter a Goal node/vertex, the algorithm successfully end.
Otherwise it continues. )
@@williammbollombassy1778 But it found G1 pretty early and G2 before G3 and didn't end yet. So what's the stop condition?
Hello, I have a weighted and undirected graph using uniform-cost search. The initial steps given to me was to repeatedly traverse all nodes until the destination is found, can I really use uniform-cost search for this or it needs a different method?
you have done a great work. Thank you !!!
Good day, i want to clarify that, does this uniform cost search is a backtracking technique?
does it expand all nodes and then uses chepast path?
Nice explanation!!!
Excellent Explanation...Thanks, please try to explain time,space complexities, completeness,optimality too
Thanks! I think another video, comparing the properties of the various search algorithms might be useful. Watch this space!
Beautiful explanation.
💯 great explanation... Tx
Masuk pak John! penjelasannya manteb betul