Across
- 1. Lowest cost first search
- 6. Structure of states
- 7. FIFO structure used in BFS
- 8. Set of all possible states
- 11. Entity that performs actions
- 13. Checks goal condition
- 15. Moves between states
- 16. Depth based search
- 18. Sliding tile problem
- 19. Function estimating cost to goal
- 22. Sequence of states to reach goal
- 23. Blind search strategy
- 25. Level order search
- 26. Structure used in search
- 27. Starting point of problem
- 28. Defines state transitions
Down
- 2. Situation of system
- 3. Level-wise exploration
- 4. Basic element of graph
- 5. Measurement to reach goal
- 6. Final desired outcome
- 9. LIFO structure used in DFS
- 10. Uses f(n)=g(n)+h(n)
- 12. Cleaning agent example
- 14. Final answer of problem
- 16. Level in search tree
- 17. AI explores possible solutions
- 20. Generate successors
- 21. Cost of a path
- 24. Uses heuristic knowledge
