Across
- 4. Process of finding a route from start state to goal state.
- 6. Process of defining states, actions, goal, and constraints of a problem.
- 7. Informed search algorithm using path cost plus heuristic estimate.
- 8. Total cost accumulated along a path from start to current node.
- 9. Can be solved from any intermediate state after an interruption.
- 11. Set of all possible states reachable in a problem.
- 13. Problems or details that can be safely overlooked in a model.
- 14. Function that generates the next possible states from a current state.
- 15. Step-by-step procedure for solving a problem.
- 16. Search strategy that uses no domain-specific guidance.
Down
- 1. Search that expands the most promising node first using an evaluation function.
- 2. Problem that can return to a previous or valid state after a wrong move.
- 3. Expands the node with the lowest cumulative path cost.
- 5. Estimated scores used to guide informed search toward the goal.
- 10. FIFO data structure commonly used in search algorithms like BFS
- 12. Describes how moving from one state leads to another state.