Please allow ads on our site
Please log in to access this content. You will be redirected to the login page shortly.
LoginWhich 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 mentioned
This question was addressed to me during an interview.
My query is from Alpha Beta Pruning topic in portion Adversarial Search of Artificial Intelligence
Artificial Intelligence Adversarial Search in Artificial Intelligence . 3 years ago
+10 pts
The CORRECT OPTION is (a) Pruned leaves X and y
Best EXPLANATION: The minimax DECISION are independant of the values of the pruned values x and y because of the root values.
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.
