| Résumé | For problems with complex state spaces, approaches based on Heuristic Search alone are not enough to find a solution simply due to the inherent complexity of the search spaces. These approaches need to be complimented by techniques that can improve the efficiency of the search algorithm. This work focuses on these techniques called Search Enhancements. Primarily we focus on the ontology and the different ways to classify the search enhancements in order to improve the understanding of the existing techniques in the hope to develop new methods.
The applications of these enhancements are discussed in the context of game playing but are equally applicable to graphs from any domain. |