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