Across
- 4. - Checking if goal is reached
- 7. - Surroundings in which problem exists
- 8. - Entity that performs actions
- 9. - Hierarchical structure of nodes
- 11. - DFS with depth restriction
- 13. - Expands lowest cost node first
- 14. - Total cost from start to goal
- 17. - Problem with fully known state
- 18. - Final sequence of actions
- 19. - Next state generated from current
- 20. - Function to rank nodes
Down
- 1. - Expands most promising node
- 2. - Repeated deepening search method
- 3. - Simple exhaustive search
- 5. - Problem with uncertain results
- 6. - Storage used by algorithm
- 10. - Problem with predictable outcomes
- 12. - Search avoiding repeated states
- 15. - Measure of efficiency
- 16. - Problem with multiple possible states