Menu

Adversarial Search Questions

MCQ
1.
General games involves ____________
forum Discussion
MCQ
2.
Adversarial search problems uses ____________
forum Discussion
MCQ
3.
Mathematical game theory, a branch of economics, views any multi-agent environment as a game provided that the impact of each agent on the others is
forum Discussion
MCQ
4.
Zero sum games are the one in which there are two agents whose actions must alternate and in which the utility values at the end of the game are always the same.
forum Discussion
MCQ
5.
Zero sum game has to be a ______ game.
forum Discussion
MCQ
6.
A game can be formally defined as a kind of search problem with the following components.
forum Discussion
MCQ
7.
The initial state and the legal moves for each side define the __________ for the game.
forum Discussion
MCQ
8.
General algorithm applied on game tree for making decision of win/lose is ____________
forum Discussion
MCQ
9.
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.
forum Discussion
MCQ
10.
What is the complexity of minimax algorithm?
forum Discussion
Page 1 of 4Next chevron_right