In this chapter, we'll look at how to perform a search, and we will cover the basic requirements of implementing a search algorithm. We'll then practice by implementing Dijkstra's algorithm, before moving on to heuristics, showing how they can be used in search algorithms to improve the accuracy of search results.
In particular, we'll be focusing on the following topics:
- An introduction to searching
- Implementing Dijkstra's search
- Understanding the notion of heuristics
- A brief introduction to the A* algorithm
- Implementing an A* algorithm
