FAI CIE Unit IV

1234567891011121314151617181920
Across
  1. 4. - Checking if goal is reached
  2. 7. - Surroundings in which problem exists
  3. 8. - Entity that performs actions
  4. 9. - Hierarchical structure of nodes
  5. 11. - DFS with depth restriction
  6. 13. - Expands lowest cost node first
  7. 14. - Total cost from start to goal
  8. 17. - Problem with fully known state
  9. 18. - Final sequence of actions
  10. 19. - Next state generated from current
  11. 20. - Function to rank nodes
Down
  1. 1. - Expands most promising node
  2. 2. - Repeated deepening search method
  3. 3. - Simple exhaustive search
  4. 5. - Problem with uncertain results
  5. 6. - Storage used by algorithm
  6. 10. - Problem with predictable outcomes
  7. 12. - Search avoiding repeated states
  8. 15. - Measure of efficiency
  9. 16. - Problem with multiple possible states