FAI Unit 4

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