About this document
Informed Search Techniques Overview by Abdullah is a document available to read on EtoBox.
The document discusses different types of informed search algorithms. It compares uninformed versus informed search, with informed search using heuristics to guide the search towards more promising paths. It describes best-first search as selecting nodes for expansion based on an evaluation function f(n). Greedy best-first search specifically uses f(n)=h(n), selecting the node with the lowest heuristic value. The document provides an example of greedy search to find the shortest route between cities in Roma
- Author
- Abdullah
- Language
- EN