3 Blind Search Algorithms
This chapter covers
- Applying different graph types for practical use
- Graph search algorithms
- Using graph traversal algorithms to explore the structure of a tree or a graph and to find a path between two nodes
- Using blind search algorithms to find the shortest path between two nodes in a graph
- Solving a real-world routing problem using graph search algorithms
You have already been introduced to deterministic and stochastic algorithms in chapter 2. In this chapter, we will focus on deterministic algorithms, specifically blind search algorithms, and their applications in exploring tree or graph structures and finding the shortest path between nodes. Using these algorithms, you can explore a maze from an initial state to a goal state, solve N-puzzle problems, figure out the distance between you and any other person on a social media graph, search a family tree to determine the exact relationship between any two people who are related or find the shortest path between any origin (e.g., your home) and any destination (e.g., your workplace or any other point of interest). Blind search algorithms are important as they are often more efficient and reasonable to use when dealing with simple, well-defined problems.