Adversarial Search Questions

MCQ bookmark_border

11.

Which is the most straightforward approach for planning algorithm?

A

Best-first search

B

State-space search

C

Depth-first search

D

Hill-climbing search

Correct Answer: B

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

12.

What are taken into account of state-space search?

A

Postconditions

B

Preconditions

C

Effects

D

Both Preconditions & Effects

Correct Answer: D

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

13.

How many ways are available to solve the state-space search?

A

1

B

2

C

3

D

4

Correct Answer: B

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

14.

What is the other name for forward state-space search?

A

Progression planning

B

Regression planning

C

Test planning

D

None of the mentioned

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

15.

How many states are available in state-space search?

A

1
 

B

2

C

3

D

4

Correct Answer: D

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

16.

What is the main advantage of backward state-space search?

A

Cost

B

Actions

C

Relevant actions

D

All of the mentioned

Correct Answer: C

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

17.

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

A

Regression planning

B

Progression planning

C

State planning

D

Test planning

Correct Answer: A

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

18.

What is meant by consistent in state-space search?

A

Change in the desired literals

B

Not any change in the literals

C

No change in goal state

D

None of the mentioned

Correct Answer: B

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

19.

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

A

Success

B

Error

C

Compilation

D

Termination

Correct Answer: D

Check Answer report_problem Report forum Discussion

MCQ bookmark_border

20.

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

A

Goal independence

B

Subgoal independence

C

Both Goal & Subgoal independence

D

None of the mentioned

Correct Answer: B

Check Answer report_problem Report forum Discussion