adplus-dvertising
frame-decoration

Question

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

a.

Depth-first search

b.

Breadth-first search

c.

Alpha-beta pruning

d.

None of the above

Answer: (c).Alpha-beta pruning

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

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

Similar Questions

Discover Related MCQs

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?

Q. What are the possible features of a text corpus?

Q. What is the major difference between CRF (Conditional Random Field) and HMM (Hidden Markov Model)?

Q. Stemming: This refers to the process of separating the prefixes and suffixes from words to derive the root word form and meaning.

Q. Production/Rule looks like________________.

Q. How can we convert AO graph with mixed nodes into graph with pure AND and OR nodes?

Q. Arc consistency in AO graph is concernd with ____________________________________.

Q. A planning problem P in BSSP is defined as a _____________.

Q. Plan representation in Plan Space Planning is done with _____________ links.

Q. What is true aboout Iterative Deepening DFS?