Menu

Question Discussion & Solution

MCQ

Q.

Which values are independant in minimax search algorithm?

A

Pruned leaves x and y

B

Every states are dependant

C

Root is independant

D

None of the mentioned

Community Discussion

No discussions yet. Be the first to start!

You must be logged in to participate in the discussion.

Login to Discuss

Similar Questions

MCQ

1.

To which depth does the alpha-beta pruning can be applied?

A

10 states

B

8 States

C

6 States

D

Any depth

Discussion

MCQ

2.

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

Discussion

MCQ

3.

General games involves ____________

A

Single-agent

B

Multi-agent

C

Neither Single-agent nor Multi-agent

D

Only Single-agent and Multi-agent

Discussion

MCQ

4.

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

Discussion

MCQ

5.

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

A

Cost

B

Actions

C

Relevant actions

D

All of the mentioned

Discussion

More Artificial Intelligence Topics

Basic Artificial Intelligence

116 MCQs

Intelligent Agents

55 MCQs

Problem Solving

96 MCQs

Logical Agents

49 MCQs

Adversarial Search

32 MCQs

Fuzzy Logic

14 MCQs

Knowledge and Reasoning

87 MCQs

Expert Systems

10 MCQs

Robotics

22 MCQs

Inductive Logic Programming

15 MCQs

LISP Programming

42 MCQs

Communicating, Perceiving and Acting

68 MCQs

Introduction

0 MCQs