adplus-dvertising
frame-decoration

Question

There is a technique by which without checking each node of the game tree we can compute the correct minimax decision, and this technique is called?

a.

alpha-beta pruning

b.

Alpha-Beta Algorithm

c.

pruning

d.

minimax algorithm

Answer: (c).pruning

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. There is a technique by which without checking each node of the game tree we can compute the correct minimax decision, and this technique is called?

Similar Questions

Discover Related MCQs

Q. The initial value of alpha is?

Q. The initial value of beta is ?

Q. The main condition which required for alpha-beta pruning is?

Q. How many types of Move Ordering in Alpha-Beta pruning?

Q. The time complexity for such an Worst order is?

Q. Complexity in ideal ordering is ?

Q. While backtracking the tree, the node values will be passed to upper nodes instead of values of alpha and beta.

Q. The MIN player will only update the value of alpha.

Q. Which search is equal to minimax search but eliminates the branches that cant influence the final decision?

Q. Which values are independant in minimax search algorithm?

Q. We will only pass the alpha, beta values to the child nodes.

Q. Which ordering consumes more time because of alpha-beta factors?

Q. In which year Donald Knuth and Ronald W. Moore refined the algorithm?

Q. ___________ is the process of transforming unstructured text into a structured format to identify meaningful patterns and new insights.

Q. In which database, data is a blend between structured and unstructured data formats?

Q. The process of breaking out long-form text into sentences and words called?

Q. Text mining is being used by large media companies, to clarify information and to provide readers with greater search experiences.

Q. Typical text mining tasks include?

Q. Which of the following technique is not a part of flexible text matching?

Q. What is the right order for a text classification model components?