Artificial Intelligence and Machine Learning: Unit I(e): Adversarial search

Two marks Questions with Answers

Adversarial search - Artificial Intelligence and Machine Learning

In a game of chance we can add extra level of chance nodes in game search tree. These nodes have successors which are the outcomes of random element.

Two Marks Question with Answer

AU: Dec.-10

Q.1 How can minimax also be extended for game of chance?

Ans.: In a game of chance we can add extra level of chance nodes in game search tree. These nodes have successors which are the outcomes of random element.

The minimax algorithm uses probability P attached with chance node di based on this value. Successor function S (N, di) give moves from position N for outcome di.

Artificial Intelligence and Machine Learning: Unit I(e): Adversarial search : Tag: : Adversarial search - Artificial Intelligence and Machine Learning - Two marks Questions with Answers


Artificial Intelligence and Machine Learning: Unit I(e): Adversarial search



Under Subject


Artificial Intelligence and Machine Learning

CS3491 4th Semester CSE/ECE Dept | 2021 Regulation | 4th Semester CSE/ECE Dept 2021 Regulation



Related Subjects


Environmental Sciences and Sustainability

GE3451 ESS 4th Semester | 2021 Regulation | 4th Semester EEE Dept 2021 Regulation


Theory of Computation

CS3452 4th Semester CSE Dept | 2021 Regulation | 4th Semester CSE Dept 2021 Regulation


Artificial Intelligence and Machine Learning

CS3491 4th Semester CSE/ECE Dept | 2021 Regulation | 4th Semester CSE/ECE Dept 2021 Regulation


Database Management System

CS3492 4th Semester CSE Dept | 2021 Regulation | 4th Semester CSE Dept 2021 Regulation


Algorithms

CS3401 4th Semester CSE Dept | 2021 Regulation | 4th Semester CSE Dept 2021 Regulation


Introduction to Operating Systems

CS3451 4th Semester CSE Dept | 2021 Regulation | 4th Semester CSE Dept 2021 Regulation