Hey, just watched this and I was a little bit confused at first also. I think his explanation complicates it a little bit, because really this is being assumed by definition before the thing even begins. When he says that the heuristic is "optimistic" -- then it means that BY DEFINITION it is underestimating the cost of reaching the goal. So if it is underestimating, then it MUST be less than the actual cost. So f(n) < f(G) . But then that's a big assumption, and the thing breaks if it isn't true. So that's why I think he makes a point to emphasize that it is important to get the heuristic estimations correct before hand, and make certain that it is actually underestimating the cost of the path to the goal.
what semester is this being taught in? I mean it is a lecture about AI yet students dont know what a BFS or DFS is. Yet this stuff you are taught in Algorithms and Data structures, which is normally at the start of the CS course. In any case AI should be taught after AD for obvious reasons (to not waste time with such trivial topics)
Thank you so much for posting these, extremely useful.
I am wondering why f(n) is less than or equal f(G).
Hey, just watched this and I was a little bit confused at first also. I think his explanation complicates it a little bit, because really this is being assumed by definition before the thing even begins. When he says that the heuristic is "optimistic" -- then it means that BY DEFINITION it is underestimating the cost of reaching the goal. So if it is underestimating, then it MUST be less than the actual cost. So f(n) < f(G) .
But then that's a big assumption, and the thing breaks if it isn't true. So that's why I think he makes a point to emphasize that it is important to get the heuristic estimations correct before hand, and make certain that it is actually underestimating the cost of the path to the goal.
@@scott4033 thanks!
thank you
What happen in Manhattan (repeat it 10 times rapidly) !!!
are these slides available online
yeah
what semester is this being taught in? I mean it is a lecture about AI yet students dont know what a BFS or DFS is. Yet this stuff you are taught in Algorithms and Data structures, which is normally at the start of the CS course. In any case AI should be taught after AD for obvious reasons (to not waste time with such trivial topics)
Lol, Romaniaaa!
it is a standard example for graph search and this slide is used around the whole world.