Need someone available now that is comfortable with these kinds of topics.
Given a tree/graph, should be able to show the DFS and A* paths between a pair of nodes S and G. Analyze the quality of the solutions.
Show the state space of a given search problem.
What are some of the actions that you can model?
Model the goal-test function
Know which algorithm should be chosen to solve a given problem statement and why
Be able to show the steps to color a graph with only X colors using a search algorithm for CSPs.