Bissoy.com
Doctors Medicines MCQs Q&A

Which of the following statements are true? (A) Minimax search is breadth-first: it processes all the nodes at a level before moving to a node in next level. (B) The effectiveness of the alpha-beta pruning is highly dependent on the order in which the states are examined. (C) The alpha-beta search algorithm computes the same optimal moves as minimax algorithm. (D) Optimal play in games of imperfact information does not require reasoning about the current and future belief states of each player. Choose the correct answer from the options given below:

Which of the following statements are true? (A) Minimax search is breadth-first: it processes all the nodes at a level before moving to a node in next level. (B) The effectiveness of the alpha-beta pruning is highly dependent on the order in which the states are examined. (C) The alpha-beta search algorithm computes the same optimal moves as minimax algorithm. (D) Optimal play in games of imperfact information does not require reasoning about the current and future belief states of each player. Choose the correct answer from the options given below: Correct Answer (B) and (C) only

The correct answer is option 3.

Key Points

Statement (A): Minimax search is breadth-first: it processes all the nodes at a level before moving to a node in the next level. But it is a depth-first search.

Hence the statement A is False.

Statement (B):  The effectiveness of the alpha-beta pruning is highly dependent on the order in which the states are examined.

Yes. It depends on which children are visited first. It's likely that no pruning happens if a node's children are visited in the worst possible order. We want to visit the best child first for max nodes so that time is not lost on the other children who are exploring worse scenarios. We want to start with the worst child when it comes to min nodes.

Hence the statement B is true.

Statement C: The alpha-beta search algorithm computes the same optimal moves as the minimax algorithm.

True, it prunes nodes that have no bearing on the final outcome.

Hence the statement C is true.

Statement D: Optimal play in games of imperfect information does not require reasoning about the current and future belief states of each player.

False, it necessitates.

Hence the statement D is False.

Related Questions

The minimax algorithm computes the minimax decision from the current state. It uses a simple recursive computation of the minimax values of each successor state, directly implementing the defining equations. The recursion proceeds all the way down to the leaves of the tree, and then the minimax values are backed up through the tree as the recursion unwinds.
In a class of 95 students, all play at least one of the three games — snooker, chess and tennis. 42 students play snooker, 49 play tennis, and 43 play chess. The total number of students who play any and only two games is 29. 5 students play all the three games. The number of students who play only snooker and only chess is equal. 11 students play only snooker and tennis. 6 students play only snooker and chess. How many students play only tennis?
A circular queue has been implemented using a singly linked list where each node consists of a value and a single pointer pointing to the next node. We maintain exactly two external pointers FRONT and REAR pointing to the front node and the near node of the queue, respectively. Which of the following statements is/are CORRECT for such a circular queue, so that insertion and deletion operations can be performed in O(1) time? I. Next pointer of front node points to the rear node. II. Next pointer of rear node points to the front node.
The following questions are based on the information given below: Out of a group of 60 students, 25 play Cricket, 30 play Football, 24 play Volleyball, 10 play Cricket and Football, 9 play Cricket and Volleyball, 12 play Volleyball and Football and 5 play all the three. How many students do not play any one of the games?
The following questions are based on the information given below: Out of a group of 60 students, 25 play Cricket, 30 play Football, 24 play Volleyball, 10 play Cricket and Football, 9 play Cricket and Volleyball, 12 play Volleyball and Football and 5 play all the three. How many students play exactly two games?
Match List I with List II List I List II (A) Greedy Best-First Search (I) Space complexity is O(d) where d = depth of the deepest optimal solution (B) A* (II) Incomplete even if the search space is finite. (C) Recursive Best-First Search (III) Optimal if optimal solution is reachable: otherwise, returns the best reachable optimal solution. (D) SMA* (IV) Computation and space complexity is too high.   Choose the correct answer from the options given below:
The following questions are based on the information given below: Out of a group of 60 students, 25 play Cricket, 30 play Football, 24 play Volleyball, 10 play Cricket and Football, 9 play Cricket and Volleyball, 12 play Volleyball and Football and 5 play all the three. How many students play Cricket only?
A certain computation generates two arrays a and b such that a[i]=f(i) for 0 ≤ i < n and b[i] = g (a[i] ) for 0 ≤ i < n. Suppose this computation is decomposed into two concurrent processes X and Y such that X computes the array a and Y computes the array b. The processes employ two binary semaphores R and S, both initialized to zero. The array a is shared by the two processes. The structures of the processes are shown below. Process X: private i; for (i=0; i
In a club of 80 members, 10 members play none of the games Tennis, Badminton and Cricket. 30 members play exactly one of these three games and 30 members play exactly two of these games. 45 members play at least one of the games among Tennis and Badminton, whereas 18 members play both Tennis and Badminton. The number of Cricket playing members is:
In a school, there are 55% students play Cricket, 50% students play Hockey and 25% students play both games. The difference between the number of students who play both games and the number of students who do not play any games is 40. Find the number of students who play only one game.