Unit 4 CIE

1234567891011121314151617181920212223242526272829
Across
  1. 3. – Explores nodes level by level
  2. 6. – Problem where actions can be undone
  3. 7. – Desired final condition
  4. 9. – Generating child nodes
  5. 10. – Defining problem elements
  6. 13. – Method used to explore states
  7. 14. – Search without domain knowledge
  8. 15. – Uniform cost search short form
  9. 17. – Starting condition of a problem
  10. 21. – Parts of a state space representation
  11. 23. – Uses cost + heuristic
  12. 24. – Practical real-world problems
  13. 26. – Expands lowest cost node
  14. 27. – Representation of a situation
  15. 28. – Depth-first search short form
  16. 29. – Sequence of steps to goal
Down
  1. 1. – Explores nodes deeply first
  2. 2. – Tree representation of search
  3. 4. – Cleaning agent example
  4. 5. – Rules to change states
  5. 8. – Uses only heuristic value
  6. 11. – Problem where actions cannot be undone
  7. 12. – Search using heuristics
  8. 16. – Generates next possible states
  9. 18. – Breadth-first search short form
  10. 19. – Method to check if goal is reached
  11. 20. – Estimated cost to goal
  12. 22. – Total cost of a solution path
  13. 23. – Possible moves from a state
  14. 25. – Tile-based problem example