CIE UNIT 4 PROBLEM SOLVING AND SEARCH STRATERGIES

12345678910
Across
  1. 2. -Combines depth-first's space efficiency with breadth-first's completeness.
  2. 4. -A function that estimates cost from a state to the goal.
  3. 6. -A check to determine if the current state is the desired one.
  4. 7. -Entity that perceives the environment and takes actions to achieve goals.
  5. 9. -A heuristic search that keeps only a fixed number of best nodes in memory.
  6. 10. - A property of heuristics that never overestimates the true cost.
Down
  1. 1. -Generates possible next states from a given state.
  2. 3. -An optimal uninformed algorithm that expands the lowest path-cost node.
  3. 5. -Process of exploring possible states to find a solution.
  4. 8. -A representation of the configuration of the problem at given time.
  5. 9. - Search strategy that explores nodes level by level using a queue.