Trying to explain this to a friend and your description of the algorithm in terms of a decision tree was brilliant. Makes things super clear (why we keep track of visited becomes self evident)! Great video 👍
Really nice videos man. I'm using search to derive equations in physics as a newcomer to CS. Your videos have helped immensely as a noob to CS research
would've been neat to know the order of traversing the child nodes beforehand. also in an actual programming stack, we would have to add the child nodes(i.e expand) in reverse order such that our topmost node after each expansion is the next first node (i.e when expanding S start by adding D to the stack, then B then A such that A is at the top of the stack), so we should draw the tree down towards the right not left, same thing just on opposite sides. I'm terrible at explanations but I picked this up from your video which means it's great
Probably with these tutorials I learned AI algorithms way more than what I learned in class, but since this algorithm is LIFO, shouldn't it start to generate nodes from the D since it is the last one entered into the stack and should be the first one to get out, instead of A?
1- In what order do we choose the items at each level? (You choose them in alphabetical order. Why?) 2- You say we treat the items list like a stack then you choose A at the first level. But how did we order them as A, B, and D in the first place? By the way, I really like the way you teach. Thank you.
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
![[Full Episode] Hell's Kitchen Thailand EP.12 | 28 เม.ย. 67](http://i.ytimg.com/vi/xCjbu5t25Pw/mqdefault.jpg)
lmao 2 hours lecture at my uni is summed up perfectly here in 7 minutes. Amazing!
somehow this english accent makes me feel smart when I listen to it lol amazing!
hahaha
Trying to explain this to a friend and your description of the algorithm in terms of a decision tree was brilliant. Makes things super clear (why we keep track of visited becomes self evident)! Great video 👍
Thank for your videos, my theory classes are really bad, and your youtube videos are saving, literally my life!
Really nice videos man. I'm using search to derive equations in physics as a newcomer to CS. Your videos have helped immensely as a noob to CS research
this guy is underrated. he deserves a million subscribers and billion views
Thank you so much for your explanation about DFS search tree, I've always get stuck at it but now it's more
clearly
Finally I found a Dr. That deserve the title
The AI Dr. In my college is all over the place
She makes the easiest thing hard to understand
sir you are great ,hope you going to continue uploading more videos , have never seen someone illustrate in that simple and precise way
great explanation John Levine
My teacher should be fired 😂... Thank you so much
Thank you, best explanation! Wish I had watched your videos before
Thank you, it really helps me with my homework
Amaizingly explained, thanks a lot
SUPER!! thank you for awesome presentation.
I feel very understandable - exactly what I am looking for
would've been neat to know the order of traversing the child nodes beforehand. also in an actual programming stack, we would have to add the child nodes(i.e expand) in reverse order such that our topmost node after each expansion is the next first node (i.e when expanding S start by adding D to the stack, then B then A such that A is at the top of the stack), so we should draw the tree down towards the right not left, same thing just on opposite sides. I'm terrible at explanations but I picked this up from your video which means it's great
Thank you, really helpful
thank you so much ! incredible
youre a life saver ❤️❤️
More like A+ for those tutorials
Awesome!!..please make more videos
i love your way thank u
THANK you !
Thank u so much, I finally understood the DFS and also for saving me from all of these Indians.
Thank you.
Probably with these tutorials I learned AI algorithms way more than what I learned in class, but since this algorithm is LIFO, shouldn't it start to generate nodes from the D since it is the last one entered into the stack and should be the first one to get out, instead of A?
After expanding A, should you not have stopped at G1?
Helal hocam, teşekkürler.
1- In what order do we choose the items at each level? (You choose them in alphabetical order. Why?)
2- You say we treat the items list like a stack then you choose A at the first level. But how did we order them as A, B, and D in the first place?
By the way, I really like the way you teach. Thank you.
You can use whatever order you want to fill the stack, you will still traverse the entire component but following a different path
thank you
Why not go to goal G1 when we are checking if B or G1 has been traversed first?
how do you decide the order of the nodes e.g. A B D. Because it really changes things
Alphabetical order.
yes it is also my question, if he decided the order is G2, F, S in the forth floor, the algorithm will stop.
Check out the arrow direction of C. From S u can't go to C.
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
why is G1 not removed?
Is there goal state for bfs nd dfs
get a bigger board LOL, ah no all joking aside that was a very good explanation! really enjoyed it
After first A, why did you choose B over G1. If you have chosen G1 over B that would be a better depth-first search
That's also my question! I couldn't figure it out?!
This choice is not really specified for depth search. How the algorithm chooses the next is node up for you to decide, as long as it's consistent.
Good video but sound is not enough
عايز اموت
Node d is mentioned again..Check the presentation again...Plz....
no it's not, it just appeared, we never expand it (branch it to it's nodes).
S,A,B,C,F,G3🤔