ISE1 IAI

12345678910111213141516171819
Across
  1. 3. Local search algorithm that moves toward a better neighboring state
  2. 6. Set of nodes that have already been explored
  3. 8. Structure consisting of nodes and edges
  4. 9. Data structure commonly used in Breadth First Search
  5. 10. A sequence of nodes connecting the initial state to the goal
  6. 11. Search algorithm that selects the node with the lowest heuristic value
  7. 13. The desired destination or target state of a search
  8. 14. Process of finding a solution in a problem space
  9. 16. A configuration of a problem at a particular point
  10. 19. An estimate used to guide an informed search
Down
  1. 1. Search strategy that searches from both initial and goal states
  2. 2. Search algorithm that expands the node with lowest path cost
  3. 4. Search algorithm that explores nodes level by level
  4. 5. A point or element in a search tree or graph
  5. 7. Set of nodes waiting to be explored
  6. 12. Search algorithm that explores deeply before backtracking
  7. 15. Search algorithm that uses f(n) = g(n) + h(n)
  8. 16. Data structure commonly used in Depth First Search
  9. 17. The value representing the expense of a path
  10. 18. Search algorithm that keeps only the best nodes at each level