CIE - 4 FAI

1234567891011121314
Across
  1. 3. Desired outcome or condition to achieve
  2. 5. Starting point where Al agent begins solving
  3. 6. Limitations or restrictions on agent operations
  4. 8. Function that estimates cost to goal in informed search
  5. 9. Data structure used in DFS for tracking visited nodes
  6. 10. Explores all nodes at present depth level (FIFO queue)
  7. 11. Search algorithm combining past cost and heuristic (f=g+h)
  8. 12. Type of problem with minimal impact on Al system
  9. 13. Model describing environment changes with agent actions
  10. 14. Representation containing all problem-solving information
Down
  1. 1. Challenge: agent lacks necessary data
  2. 2. Finds least cost path in weighted graph
  3. 4. Algorithm exploring deepest branch before backtracking
  4. 7. Informed search using heuristic evaluation
  5. 11. Operations or moves agent can perform between states