October 2024
Intermediate to advanced
536 pages
20h 56m
English
This chapter covers
In the previous chapter, we covered blind search algorithms, which are algorithms in which no information about the search space is needed. In this chapter, we’ll look at how search can be further optimized if we utilize some information about the search space during the search.
As problems and search spaces become larger and more complex, the complexity of the algorithms themselves increases. I’ll start by introducing informed search algorithms, and then we’ll discuss minimum spanning ...
Read now
Unlock full access