The AND-OR-GRAPH-SEARCH algorithm in Figure 4.11 checks for repeated states

The AND-OR-GRAPH-SEARCH algorithm in Figure 4.11 checks for repeated states only on the path from the root to the current state. Suppose that, in addition, the algorithm were to store every visited state and check against that list. (See BREADTH-FIRST-SEARCH in Figure 3.11 for an example.) Determine the information that should be stored and how the algorithm should use that information when a repeated state is found. 


Figure 4.11

function AND-OR-GRAPH-SEARCH(problem) returns a conditional plan, or failure OR-SEARCH(problem.INITIAL-STATE, problem, [


Figure 3.11

function BREADTH-FIRST-SEARCH( problem) returns a solution, or failure node - a node with STATE = problem.INITIAL-STATE,

Members

  • Access to 2 Million+ Textbook solutions
  • Ask any question from 24/7 available
    Tutors
$9.99
VIEW SOLUTION

OR

Non-Members

Get help from Computer science Tutors
Ask questions directly from Qualified Online Computer science Tutors .
Best for online homework assistance.