FAI CIE UNIT 4

123456789101112131415161718192021222324252627282930
Across
  1. 5. A data handling method where the first element inserted is the first one removed
  2. 14. An informed search algorithm that uses cost and heuristic to find optimal paths
  3. 15. A search method that selects the most promising node based on evaluation function
  4. 17. A description of how actions change one state into another
  5. 19. A method where the last element inserted is the first one removed
  6. 22. A search strategy that uses problem-specific knowledge (heuristics) to find solutions efficiently
  7. 24. The process of systematically browsing the web using search strategies
  8. 25. The set of all possible states reachable from the initial state
  9. 28. A search algorithm that explores nodes level by level
  10. 30. A step-by-step procedure to solve a problem or perform a task
Down
  1. 1. The process of finding a solution for structured problems like puzzles
  2. 2. The starting point of a problem before any actions are applied
  3. 3. The node that satisfies the objective of the problem
  4. 4. A technique of going back to previous states to find alternative solutions
  5. 6. The creation of a maze structure often used to test search algorithms
  6. 7. Restrictions or conditions that limit possible solutions
  7. 8. A problem or part of it that can be ignored without affecting the solution
  8. 9. The node representing the initial state in a search tree
  9. 10. A search algorithm that selects nodes based only on heuristic value
  10. 11. The total cost incurred to travel from start node to goal node
  11. 12. A search strategy that explores the state space without using any domain knowledge
  12. 13. A search algorithm that explores as deep as possible before backtracking
  13. 16. A search algorithm that expands the node with the lowest path cost
  14. 18. A node that generates one or more child nodes
  15. 20. The process of finding a sequence of actions to reach a goal state from an initial state
  16. 21. The process of exploring a state space to find a solution
  17. 23. A data structure that follows LIFO order
  18. 26. The process of determining a route from start to goal
  19. 27. A sequence of states or nodes connecting the start to the goal
  20. 29. An operation that moves the system from one state to another