PYTHON-GAME THEORY

A game can be formally defined as a kind of search problem with the following components.

• Initial State
  
  
  

• Successor Function

• Terminal Test

• All of the mentioned

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

• Search Tree
  

• Game Tree

• State Space Search

• Forest

Which is the following applied in minimax algorithm?

• BFS

• DFS

• GREEDY

• A*

Among the given options, which search algorithm requires less memory?

• Optimal search

• BFS

• DFS

• Linear

Which statement is valid for the Heuristic function?

• 1. The heuristic function is used to solve mathematical problems.

• 1. The heuristic function does not have any return type.

• 1. The heuristic function takes parameters of type string and returns an integer value.

• 1. The heuristic function calculates the cost of an optimal path between the pair of states.

Adversarial search problems uses _____

• Cooperative Environment

• Competitive Environment

• Only Competitive and Cooperative Environment

• Neither Competitive nor Cooperative Environment

Blind Search (uninformed search)can be used for which of the following situations?

• Real life simulations

• small search space

• advanced game theory

• none of the above

Example for combinational search algorithm

• BFS

• Uniform cost

• linear search

• greedy search

Worst case value of maximiser during game playing

• -infinity

• +infinity

• 0

• 1

DFS implemented using

• queue

• stack

• priority queue

• linked list