Across
- 1. Transition from one state to another using action
- 4. Algorithm that always finds solution if exists
- 6. Sequence of actions leading to goal state
- 7. Successor node generated from parent
- 12. Process of exploring state space to find solution
- 13. Predecessor node in a search tree
- 14. Function used to choose best node in search
- 15. Number of successors from a node
- 18. Data structure used in depth first search
- 19. Process of generating child nodes
Down
- 2. Set of already visited nodes
- 3. Data structure used in breadth first search
- 5. Technique of reversing steps when dead end reached
- 6. Tree representation of state space exploration
- 8. Function that assigns cost to path
- 9. Operation applied to a state to generate new state
- 10. Algorithm that finds least cost solution
- 11. Level of a node in search tree
- 16. Representation of a state in search tree
- 17. Set of nodes available for exploration