FAI CIE 4

3. A search strategy (DFS) that explores as far as possible along each branch before backtracking
4. A type of search strategy, also known as "blind search," that has no additional information about the goal's distance
5. A common application of DFS used for generating complex layouts of passages and walls
6. A popular informed search algorithm that uses both path cost and a heuristic to find the optimal path.
7. A representation of the environment at a specific moment, such as an airport location in a travel problem.
10. A rule of thumb or estimate used in informed search to guide the agent toward the goal.
14. The "path ____" represents the total effort (like steps or time) required to reach the goal.
15. The possible steps or moves (operators) an agent can take from a given state.
16. The starting point or state from which an agent begins the problem-solving process

1. An entity that perceives its environment and acts upon it to achieve specific goals.
2. A type of problem where mistakes can be corrected, though it might be costly
8. A model that describes what happens to the environment after an agent takes a specific action.
9. A search strategy (BFS) that explores all nodes at the current depth level before moving to the next.
11. Components through which an agent perceives its environment.
12. The desired final state or condition that signifies the completion of a task.
13. The data structure used by the Depth First Search (DFS) algorithm to manage nodes.