# Game Planning

`Game Theory – 1`

This set of Artificial Intelligence MCQs focuses on “Game Theory – 1”.

1. General games involves,

a) Single-agent

b) Multi-agent

c) Neither a nor b

d) Only a and b

a) Competitive Environment

b) Cooperative Environment

c) Neither a nor b

d) Only a and b

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

“significant,” regardless of whether the agents are

cooperative or competitive.

a) True

b) False

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.

a) True

b) False

5. Zero sum game has to be a ______ game.

a) Single player

b) Two player

c) Multiplayer

d) Three player

6. A game can be formally defined as a kind of search

problem with the following components:

a) Initial State

b) Successor Function

c) Terminal Test

d) Utility Function

7. The initial state and the legal moves for each side

define the __________ for the game.

a) Search Tree

b) Game Tree

c) State Space Search

d) Forest

8. General algorithm applied on game tree for making

decision of win/lose is ____________

a) DFS/BFS Search Algorithms

b) Heuristic Search Algorithms

c) Greedy Search Algorithms

d) MIN/MAX Algorithms

10. The complexity of minimax algorithm is

a) Same as of DFS

b) Space – bm and time – bm

c) Time – bm and space – bm

d) Same as BFS

`Game Theory – 2`

1. Which search is equal to minimax search but

eliminates the branches that can’t influence the final

decision?

a) Depth-first search

c) Alpha-beta pruning

d) None of the mentioned

2. Which search is similar to minimax search?

a) Hill-climbing search

b) Depth-first search

d) All of the mentioned

3. How the effectiveness of the alpha-beta pruning gets

increased?

a) Depends on the nodes

b) Depends on the order in which they are executed

c) Both a & b

d) None of the mentioned

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

a) Hill climbing search algorithm

b) Depth-first search

c) Transposition table

d) None of the mentioned

5. Which function is used to calculate the feasibility of

whole game tree?

a) Evaluation function

b) Transposition

c) Alpha-beta pruning

d) All of the mentioned

6. What is called as transposition table?

a) Hash table of next seen positions

b) Hash table of previously seen positions

c) Next value in the search

d) None of the mentioned

7. Where does the values of alpha-beta search get

updated?

a) Along the path of search

b) Initial state itself

c) At the end

d) None of the mentioned

8. Which value is assigned to alpha and beta in the alphabeta

pruning?

a) Alpha = max

b) Beta = min

c) Beta = max

d) Both a & b

9. To which depth does the alpha-beta pruning can be

applied?

a) 10 states

b) 8 States

c) 6 States

d) Any depth

10. Which values are independent in minimax search

algorithm?

a) Pruned leaves x and y

b) Every state is dependent

c) Root is independent

d) None of the mentioned

`State Space Search`

1. Which is the most straight forward appproach for

planning algorithm?

a) Best-first search

b) State-space search

c) Depth-first search

d) Hill-climbing search

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

a) Postconditions

b) Preconditions

c) Effects

d) Both b & c

3. How many ways are available to solve the state-space

search?

a) 1

b) 2

c) 3

d) 4

4. What is the other name for forward state-space

search?

a) Progression planning

b) Regression planning

c) Test planning

d) None of the mentioned

5. How many states are available in state-space search?

a) 1

b) 2

c) 3

d) 4

6. What is the main advantage of backward state-space

search?

a) Cost

b) Actions

c) Relevant actions

d) All of the mentioned

7. What is the other name of backward state-space

search?

a) Regression planning

b) Progression planning

c) State planning

d) Test planning

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

a) Change in the desired literals

b) Not any change in the literals

c) No change in goal state

d) None of the mentioned

9. What will happen if a predecessor description is

generated that is satisfied

by the initial state of the planning problem?

a) Success

b) Error

c) Compilation

d) Termination

10. Which approach is to pretend that a pure divide and

conquer algorithm will

work?

a) Goal independance

b) Sub-goal independance

c) Both a & b

d) None of the mentioned

`Alpha Beta Prune`

1. Which search is equal to minimax search but

eliminates the branches that

can’t influence the final decision?

a) Depth-first search

c) Alpha-beta pruning

d) None of the mentioned

2. Which values are independant in minimax search

algorithm?

a) Pruned leaves x and y

b) Every states are dependant

c) Root is independant

d) None of the mentioned

3. To which depth does the alpha-beta pruning can be

applied?

a) 10 states

b) 8 States

c) 6 States

d) Any depth

4. Which search is similar to minimax search?

a) Hill-climbing search

b) Depth-first search

d) All of the mentioned

5. Which value is assigned to alpha and beta in the alphabeta

pruning?

a) Alpha = max

b) Beta = min

c) Beta = max

d) Both a & b

6. Where does the values of alpha-beta search get

updated?

a) Along the path of search

b) Initial state itself

c) At the end

d) None of the mentioned

7. How the effectiveness of the alpha-beta pruning gets

increased?

a) Depends on the nodes

b) Depends on the order in which they are executed

c) Both a & b

d) None of the mentioned

8. What is called as transposition table?

a) Hash table of next seen positions

b) Hash table of previously seen positions

c) Next value in the search

d) None of the mentioned

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

a) Hill climbing search algorithm

b) Depth-first search

c) Transposition table

d) None of the mentioned

10. Which function is used to calculate the feasibility of

whole game tree?

a) Evaluation function

b) Transposition

c) Alpha-beta pruning

d) All of the mentioned

`State Space Search and Alpha-Beta Pruning – 1`

1. Which is the most straightforward approach for

planning algorithm?

a) Best-first search

b) State-space search

c) Depth-first search

d) Hill-climbing search

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

a) Post conditions

b) Preconditions

c) Effects

d) Both b & c

3. How many ways are available to solve the state-space

search?

a) 1

b) 2

c) 3

d) 4

4. What is the other name for forward state-space

search?

a) Progression planning

b) Regression planning

c) Test planning

d) None of the mentioned

5. How many states are available in state-space search?

a) 1

b) 2

c) 3

d) 4

6. What is the main advantage of backward state-space

search?

a) Cost

b) Actions

c) Relevant actions

d) All of the mentioned

7. What is the other name of backward state-space

search?

a) Regression planning

b) Progression planning

c) State planning

d) Test planning

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

a) Change in the desired literals

b) Not any change in the literals

c) No change in goal state

d) None of the mentioned

9. What will happen if a predecessor description is

generated that is satisfied by the initial state of the

planning problem?

a) Success

b) Error

c) Compilation

d) Termination

10. Which approach is to pretend that a pure divide and

conquer algorithm will work?

a) Goal independence

b) Sub-goal independence

c) Both a & b

d) None of the mentioned

`State Space Search and Alpha-Beta Pruning – 2`

1. Which search is equal to minimax search but

eliminates the branches that cannot influence the final

decision?

a) Depth-first search

c) Alpha-beta pruning

d) None of the mentioned

2. Which values are independent in minimax search

algorithm?

a) Pruned leaves x and y

b) Every state is dependant

c) Root is independent

d) None of the mentioned

3. To which depth does the alpha-beta pruning can be

applied.

a) 10 states

b) 8 States

c) 6 States

d) Any depth

4. Which search is similar to minimax search?

a) Hill-climbing search

b) Depth-first search

d) All of the mentioned

5. Which value is assigned to alpha and beta in the alphabeta

pruning?

a) Alpha = max

b) Beta = min

c) Beta = max

d) Both a & b

6. Where are the values of alpha-beta search updated?

a) Along the path of search

b) Initial state itself

c) At the end

d) None of the mentioned

7. How the effectiveness of the alpha-beta pruning is

increased?

a) Depends on the nodes

b) Depends on the order in which they are executed

c) Both a & b

30

d) None of the mentioned

8. What is called as transposition table?

a) Hash table of next seen positions

b) Hash table of previously seen positions

c) Next value in the search

d) None of the mentioned

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

a) Hill climbing search algorithm

b) Depth-first search

c) Transposition table

d) None of the mentioned

10. Which function is used to calculate the feasibility of

completely game tree?

a) Evaluation function

b) Transposition

c) Alpha-beta pruning

d) All of the mentioned

`State Space Search and Alpha-Beta Pruning – 2`

1. Which search is equal to minimax search but

eliminates the branches that cannot influence the final

decision?

a) Depth-first search

c) Alpha-beta pruning

d) None of the mentioned

2. Which values are independent in minimax search

algorithm?

a) Pruned leaves x and y

b) Every state is dependant

c) Root is independent

d) None of the mentioned

3. To which depth does the alpha-beta pruning can be

applied.

a) 10 states

b) 8 States

c) 6 States

d) Any depth

4. Which search is similar to minimax search?

a) Hill-climbing search

b) Depth-first search

d) All of the mentioned

5. Which value is assigned to alpha and beta in the alphabeta

pruning?

a) Alpha = max

b) Beta = min

c) Beta = max

d) Both a & b

6. Where are the values of alpha-beta search updated?

a) Along the path of search

b) Initial state itself

c) At the end

d) None of the mentioned

7. How the effectiveness of the alpha-beta pruning is

increased?

a) Depends on the nodes

b) Depends on the order in which they are executed

31

c) Both a & b

d) None of the mentioned

8. What is called as transposition table?

a) Hash table of next seen positions

b) Hash table of previously seen positions

c) Next value in the search

d) None of the mentioned

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

a) Hill climbing search algorithm

b) Depth-first search

c) Transposition table

d) None of the mentioned

10. Which function is used to calculate the feasibility of

completely game tree?

a) Evaluation function

b) Transposition

c) Alpha-beta pruning

d) All of the mentioned