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 the mentionedThe question was posed to me at a job interview.The doubt is from Game Theory in portion Adversarial Search of Artificial Intelligence

A game can be formally defined as a kind of search problem with the fo

1.	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 the mentionedThe question was posed to me at a job interview.The doubt is from Game Theory in portion Adversarial Search of Artificial Intelligence
Answer» Right choice is (d) All of the mentioned The 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.

Discussion

No Comment Found

Related InterviewSolutions

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 mentionedThe question was posed to me in an interview for job.My doubt is from Alpha Beta Pruning topic in section Adversarial Search of Artificial Intelligence
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 mentionedI had been asked this question during an internship interview.This is a very interesting question from Alpha Beta Pruning in portion Adversarial Search of Artificial Intelligence
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 mentionedI had been asked this question in a job interview.This key question is from Alpha Beta Pruning topic in section Adversarial Search of Artificial Intelligence
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 mentionedThis question was posed to me in quiz.I want to ask this question from Alpha Beta Pruning topic in section Adversarial Search of Artificial Intelligence
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) All of the mentioned(d) None of the mentionedI had been asked this question by my school principal while I was bunking the class.This key question is from Alpha Beta Pruning in division Adversarial Search of Artificial Intelligence
Which value is assigned to alpha and beta in the alpha-beta pruning?(a) Alpha = max(b) Beta = min(c) Beta = max(d) Both Alpha = max & Beta = minThe question was posed to me in an interview for internship.Asked question is from Alpha Beta Pruning topic in portion Adversarial Search of Artificial Intelligence
To which depth does the alpha-beta pruning can be applied?(a) 10 states(b) 8 States(c) 6 States(d) Any depthThis question was addressed to me in an interview for internship.The doubt is from Alpha Beta Pruning in chapter Adversarial Search of Artificial Intelligence
Which search is similar to minimax search?(a) Hill-climbing search(b) Depth-first search(c) Breadth-first search(d) All of the mentionedThe question was posed to me in a job interview.Asked question is from Alpha Beta Pruning in chapter Adversarial Search of Artificial Intelligence
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 mentionedThis question was addressed to me during an interview.My query is from Alpha Beta Pruning topic in portion Adversarial Search of Artificial Intelligence
Which search is equal to minimax search but eliminates the branches that can’t influence the final decision?(a) Depth-first search(b) Breadth-first search(c) Alpha-beta pruning(d) None of the mentionedI have been asked this question at a job interview.Origin of the question is Alpha Beta Pruning in division Adversarial Search of Artificial Intelligence

Discussion

No Comment Found

Related InterviewSolutions

Reply to Comment