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) All of these
Explanation: The initial state includes the board position and identifies the player to move. A successor function returns a list of (move, state) pairs, each indicating a legal move and the resulting state. A terminal test determines when the game is over. States where the game has ended are called terminal states. A utility function (also called an objective function or payoff function), which gives a numeric value for the terminal states. In chess, the outcome is a win, lose, or draw, with values +1, -1, or 0.
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
Explanation: An example of game tree for Tic-Tac-Toe game.
What is the complexity of minimax algorithm?
a) Same as of DFS
b) Space – bm and time – bm
c) Time – bm and space – bm
d) Same as BFS
State Space Search:
State Space Search:
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
Explanation: The straightforward approach for planning algorithm is state space search because it takes into account of everything for finding a solution.
