FAI Unit 4 CIE

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