Google Applied CS - Day 4

Day 4:

A* search (Heap & Priority queue)

Transcript

1. Day 4
2. A* search
3. Admissible “A heuristic function is said to be admissible if it never overestimates the cost of reaching the goal.” GTU, Department of unnecessary complexity
5. Example
6. Euclidean distance
8. “Ordinary (i.e. straight-line) distance between two points.” Euclidean him self
9. “Estimation should not be higher than the actual lowest possible value.” Sincerely me, Department of necessary simplicity !