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 AlgorithmsI had been asked this question in an online quiz.Enquiry is from Game Theory in section Adversarial Search of Artificial Intelligence

General algorithm applied on game tree for making decision of win/lose

1.	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 AlgorithmsI had been asked this question in an online quiz.Enquiry is from Game Theory in section Adversarial Search of Artificial Intelligence
Answer» Correct answer is (d) MIN/MAX Algorithms To explain: GIVEN a game tree, the optimal strategy can be determined by examining the min/max value of each node, which we write as MINIMAX- VALUE(N). The min/max value of a node is the utility (for MAX) of being in the corresponding state, assuming that both PLAYERS play optimally from there to the end of the game. Obviously, the min/max value of a terminal state is just its utility. FURTHERMORE, given a choice, MAX will PREFER to move to a state of maximum value, whereas MIN prefers a state of minimum value.

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