FAI CIE UNIT-IV CROSSWORD

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