Module 2

3. has the lowest path cost among all solutions.
5. actions.
11. Does the strategy find the optimal solution?
12. How much memory is needed to perform the search?
14. How long does it take to find a solution?
16. that the agent starts in.
17. is a node with no children in the tree.
18. in the state space is a sequence of states connected by a sequence of actions.
19. in the state space to which the node corresponds;
20. is the process of deciding what actions and states to consider, given a goal.

1. that was applied to the parent to generate the node;
2. agent is a goal-based agent and use atomic representations.
4. in the search tree that generated this node;
6. determines whether a given state is a goal state.
7. The set of all leaf nodes available for expansion at any given point is called.
8. takes a problem as input and returns a solution in the form of an action
9. function that assigns a numeric cost to each path.
10. Is the algorithm guaranteed to find a solution when there is one?
13. is the third phase in problem solving agent
15. of the problem is the set of all states reachable from the initial state by any sequence