Across
- 2. Function combining cost and heuristic
- 5. Expanding the earliest generated node first
- 8. Search that uses extra domain knowledge
- 11. Problem without a fixed solution method
- 12. Memory usage in DFS
- 14. Steps taken from start to goal
- 20. Exploring alternative paths after failure
- 21. Exploration deep into a branch before backtracking
- 22. Node waiting to be expanded
- 23. Strategy choosing best immediate option
- 26. Final solution obtained
- 27. Structure used in BFS
- 28. Collection of all reachable states
- 29. Search guided by heuristic information
- 30. Process of visiting nodes systematically
Down
- 1. Search without prior knowledge
- 3. Set of explored nodes
- 4. Node with no children
- 6. Selecting node with least cost
- 7. Problems involving uncertainty
- 9. Traversal method visiting level by level
- 10. Principle followed in DFS
- 13. Structure used in uniform cost search
- 15. Algorithm based on path cost
- 16. Repeated execution of steps
- 17. A vertex in a graph
- 18. Representation of all possible problem states
- 19. Entity that performs actions independently
- 24. Structure used in depth-first search
- 25. Cost assigned to each move