The previous exercise discusses the conversion of AND-OR search trees to general graphs. Discuss how you can apply AND-OR search to a general state-space graph, which is not structured as a tree. You may assume that each state includes information about which agent is making the transition. [Hint: The main difference from the ANDOR search algorithm on trees is the need to keep track of states that have been visited.

You may find the framework of single-agent search useful in providing guidelines.]