General games involves ____________

Adversarial search problems uses ____________

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.

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?

Quiz/Test Summary

Title:
Adversarial Search: An "enemy" or "opponent" Changing the State of the Problem Every Step in a direction you do not Want

Questions:
15

Contributed by: