Please allow ads on our site
Please log in to access this content. You will be redirected to the login page shortly.
LoginGeneral 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
I had been asked this question in an online quiz.
Enquiry is from Game Theory in section Adversarial Search of Artificial Intelligence
Artificial Intelligence Adversarial Search in Artificial Intelligence . 3 years ago
+10 pts
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.
Posted on 02 Dec 2021, this text provides information on Artificial Intelligence related to Adversarial Search in Artificial Intelligence. Please note that while accuracy is prioritized, the data presented might not be entirely correct or up-to-date. This information is offered for general knowledge and informational purposes only, and should not be considered as a substitute for professional advice.
Take Quiz To Earn Credits!
Turn Your Knowledge into Earnings.
Answers
No matter what stage you're at in your education or career, TuteeHub will help you reach the next level that you're aiming for. Simply,Choose a subject/topic and get started in self-paced practice sessions to improve your knowledge and scores.
