Share your knowledge on Readable
Collaborate with others to annotate & explain the things you love

Merry X'mas! Cheers! Let Santa Claus open it, my lady. It's hard to drink because my fake mustache bother a lot. Gonna try it after recording. Ladies and Gentlemen! Oops! I'm...

1

annotations

So, we've looked at 2 search algorithms. One, breadth-first search, in which we always expand first the shallowest paths, the shortest paths. Second, cheapest-first search, in which we always...
Here we give you an intuition as to why an optimistic heuristic function, h, finds the lowest-cost path. When A-star ends, it returns a path, p, with estimated cost, c. It turns out that c is also the...