adplus-dvertising
frame-decoration

Question

Adversarial search problems uses

a.

Competitive Environment

b.

Cooperative Environment

c.

Neither a nor b

d.

Only a and b

Answer: (a).Competitive Environment

Engage with the Community - Add Your Comment

Confused About the Answer? Ask for Details Here.

Know the Explanation? Add it Here.

Q. Adversarial search problems uses

Similar Questions

Discover Related MCQs

Q. The initial state and the legal moves for each side define the __________ for the game.

Q. General algorithm applied on game tree for making decision of win/lose is ____________.

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

Q. Which search is similar to minimax search?

Q. How the effectiveness of the alpha-beta pruning gets increased?

Q. Which is identical to the closed list in Graph search?

Q. Which function is used to calculate the feasibility of whole game tree?

Q. What is called as transposition table?

Q. Where does the values of alpha-beta search get updated?

Q. Which value is assigned to alpha and beta in the alpha-beta pruning?

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

Q. Which values are independent in minimax search algorithm?

Q. Which is the most straightforward approach for planning algorithm?

Q. What are conditions taken into account of state-space search?

Q. How many ways are available to solve the state-space search?

Q. What is the other name for forward state-space search?

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

Q. What is the other name of backward state-space search?

Q. What is meant by consistent in state-space search?

Q. What will happen if a predecessor description is generated that is satisfied by the initial state of the planning problem?