Informed Search Algorithms
Be smart about what paths to try
- Best first search
- IDA*
- Hill Climbing
- Beam Search
Best First Search
Best-first search is a class of search algorithms, which explores a graph by expanding the most promising node chosen according to a specified rule.