This is a computer science engineering quiz on Artificial intelligence, which includes questions on Adversarial search i.e a search, where we examine the problem which arises when we try to plan ahead of the world and other agents are planning against us.
General games involves ____________
Adversarial search problems uses ____________
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 “significant,” regardless of whether the agents are cooperative or competitive.
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.
Zero sum game has to be a ______ game.
What is the complexity of minimax algorithm?
General algorithm applied on game tree for making decision of win/lose is ____________
The initial state and the legal moves for each side define the __________ for the game.
A game can be formally defined as a kind of search problem with the following components.
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.
Which is the most straightforward approach for planning algorithm?
What are taken into account of state-space search?
How many ways are available to solve the state-space search?
What is the other name for forward state-space search?
How many states are available in state-space search?