Q. What is the other name of backward state-space search?

View solution

Q. What is meant by consistent in state-space search?

View solution

Q. What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem?

View solution

Q. Which approach is to pretend that a pure divide and conquer algorithm will work?

View solution

Q. In 1985, the famous chess player David Levy beat a world champion chess program in four straight games by using orthodox moves that confused the program. What was the name of the chess program?

View solution

Q. The process by which the brain incrementally orders actions needed to complete a specific task is referred as ______________

View solution

Q. Following is/are the components of the partial order planning.

View solution

Q. Sussman Anomaly can be easily and efficiently solved by partial order planning.

View solution

Q. Which of the following search belongs to totally ordered plan search?

View solution

Q. Which cannot be taken as advantage for totally ordered plan search?

View solution

Q. What is the advantage of totally ordered plan in constructing the plan?

View solution

Q. How many possible plans are available in partial-order solution?

View solution

Q. What are present in the empty plan?

View solution

Q. What are not present in start actions?

View solution

Q. What are not present in finish actions?

View solution