Across
- 3. Best possible solution across the entire state space
- 4. Region where neighboring states have same value
- 8. Entire landscape of possible states in a problem
- 10. Speed at which a search algorithm finds the solution
- 11. Criterion used in simulated annealing to accept worse moves
- 13. Strategy that explores multiple branches to find solution
- 14. Function estimating cost to reach goal from a state
Down
- 1. Strategy that operates on a single current state
- 2. Technique used in continuous domains similar to hill climbing
- 5. Hill climbing variant that examines neighbors randomly until a better one is found
- 6. State better than neighbors but not the best overall
- 7. Local search algorithm that moves in the direction of increasing value
- 9. Set of all possible configurations in a search problem
- 12. A state reachable from current state in one step