Explain the Heuristic search and two different types of it.
- take the most promising node
- is a way to inform the search about the direction to a goal
Greedy search - best-first
- Takes the best path, from a local point of view
- Greedy - At each step - tries to get as close to the goal as possible
- When a step is taken - Never goes back!
Hill climbing
-Mathematica optimization
-Start with initial solution and pick neighboring solutions and evaluate them