Virtual Labs

Tools

Aim

Theory

Procedure

Pretest

Demo

Practice

Posttest

References

Contributors

Feedback

Aim

Theory

Procedure

Pretest

Demo

Practice

Posttest

References

Contributors

Feedback

Minimax Search

Choose difficulty:

Beginner

Intermediate

Advanced

In Tic-Tac-Toe, if we don't use depth as parameter while mapping to graph, then which of the following will be true?

a: There will be only 1 path Explanation

Explanation

b: We will terminate quickly as compared to when we use depth Explanation

Explanation

c: Both a and b Explanation

Explanation

d: None of these Explanation

Explanation

Alpha beta pruning is used for?

a: Reducing number of nodes that are considered Explanation

Explanation

b: Optimize minimax algorithm Explanation

Explanation

c: Mostly useful when large number of states such as in chess Explanation

Explanation

d: All of these Explanation

Explanation

What is the main disadvantage of the Minimax algorithm?

a: It is computationally intensive for large game trees Explanation

Explanation

b: It does not guarantee finding the optimal solution Explanation

Explanation

c: It is difficult to implement Explanation

Explanation

d: It only works for zero-sum games Explanation

Explanation

What is the main advantage of using a Minimax tree in game theory?

a: It guarantees finding the optimal solution Explanation

Explanation

b: It is computationally efficient for large game trees Explanation

Explanation

c: It is easier to implement than other algorithms Explanation

Explanation

d: It works well for non-zero-sum games Explanation

Explanation

What is the time complexity of the Minimax algorithm for a complete tree where n is the number of moves?

a: O(n) Explanation

Explanation

b: O(log n) Explanation

Explanation

c: O(n^2) Explanation

Explanation

d: O(2^n) Explanation

Explanation

Community Links Sakshat Portal Outreach Portal FAQ: Virtual Labs

AGPL 3.0 & Creative Commons (CC BY-NC-SA 4.0)