| 21. | What is meant by consistent in state-space search? |
|
Answer: (b).Not any change in the literals
|
| 22. | What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem? |
|
Answer: (d).Termination
|
| 23. | Which approach is to pretend that a pure divide and conquer algorithm will work? |
|
Answer: (b).Sub-goal independence
|
| 24. | 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? |
|
Answer: (b).CRAY BLITZ
|
| 25. | The process by which the brain incrementally orders actions needed to complete a specific task is referred as ______________ |
|
Answer: (c).Partial order planning
|
| 26. | Following is/are the components of the partial order planning. |
|
Answer: (d).All of the above
|
| 27. | Sussman Anomaly can be easily and efficiently solved by partial order planning. |
|
Answer: (a).True
|
| 28. | Which of the following search belongs to totally ordered plan search? |
|
Answer: (a).Forward state-space search
|
| 29. | Which cannot be taken as advantage for totally ordered plan search? |
|
Answer: (c).Problem decomposition
|
| 30. | What is the advantage of totally ordered plan in constructing the plan? |
|
Answer: (c).Flexibility
|
