Scribd
Upload
174 views3 pages

Assignment 3 Without 9,10 Ans

The document outlines the details of Assignment 3 for the NPTEL course on Fundamentals of Artificial Intelligence, including submission deadlines and assessment questions related to game theory and algorithms. It features multiple-choice questions on topics such as AND/OR search, Alpha-beta pruning, and Minimax algorithms. The assignment allows for multiple submissions before the due date, with the final submission being graded.

Uploaded by

B. Meenakshi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
174 views3 pages

Assignment 3 Without 9,10 Ans

The document outlines the details of Assignment 3 for the NPTEL course on Fundamentals of Artificial Intelligence, including submission deadlines and assessment questions related to game theory and algorithms. It features multiple-choice questions on topics such as AND/OR search, Alpha-beta pruning, and Minimax algorithms. The assignment allows for multiple submissions before the due date, with the final submission being graded.

Uploaded by

B. Meenakshi
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 3

Assessment submitted.

(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)
X

[email protected]

NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Fundamentals Of Artificial Intelligence

(course)

If already
registered, click
Thank you for taking the
to check your
payment status
Assignment 3.

Course Assignment 3
outline Your last recorded submission was on 2023-08-16, 14:17 Due date: 2023-08-16, 23:59 IST.
IST
How does an
1) For more complex games, such as chess or checker the AND/OR search to 1 point
NPTEL
online termination is out of question. Which of the following statements are true? I. Our goal in
course searching such a game tree might be, instead, to find a good first move. II. Extract from the
work? () search graph an estimate of the ‘best’ first move.

A. Both I and II are true


Week 0:
Prerequisites B. Only II
() C. Only I
D. Both I and II are false
Week 1: AI
and AI 2) Algorithm AO* can best be seen as TWO major operations: 1 point
Problem
Solving () A. 1. Top-down: graph-growing; 2. Bottom-up: cost-revising, SOLVE-labelling.
B. 1. Bottom-up: graph-growing; 2. Top-down: cost-revising, SOLVE-labelling.
Week 2:
C. 1. Top-down: graph-growing, SOLVE-labelling; 2. Bottom-up: cost-revising.
Problem
Solving by D. 1. Bottom-up: graph-growing, SOLVE-labelling; 2. Top-down: cost-revising.
Search - I ()
3) In the pay-off matrix of a zero-sum game, an outcome is __________ if the outcome 1 point
Week 3: is a minimum in its row and maximum in its column.
Problem
Solving by A. a critical point
Search - II () B. an inflexion point
C. a saddle point
Lec 1:
Searching D. a stable point
AND/OR
Graphs (unit? 4) Alpha-beta pruning had been reinvented a number of times! The earliest version 1 point
Assessment submitted.
unit=27&lesso was by ________________________ for a checkers simulation.
X n=28)
A. Marvin Minsky
Lec 2: Game
Playing (unit? B. Alan Turing
unit=27&lesso C. Arthur Samuel
n=29)
D. Peter Corke
Lec 3:
Minimax + 5) Assertion A A solution graph of an AND-OR graph is analogous to a path in an 1 point
Alpha-Beta ordinary graph. Reason R AO* algorithm use a single structure - a graph - representing part of
(unit?
the search graph that has been explicitly generated so far. Mark the correct choice as
unit=27&lesso
n=30) A. Both A and R are true and R is the correct explanation for A
Quiz: B. Both A and R are true but R is not the correct explanation for A
Assignment 3
C. A is True but R is False
(assessment?
name=117) D. A is false but R is True

Feedback
6) Assertion A: Search procedure for Minimax that we have discussed is grossly 1 point
Form (unit?
inefficient strategy. Reason R: The search procedure separates completely the processes of
unit=27&lesso
search-tree generation and position evaluation. Mark the correct choice as
n=31)

A. Both A and R are true and R is the correct explanation for A


Week 4:
Knowledge B. Both A and R are true but R is not the correct explanation for A
Representati C. A is True but R is False
on and
D. A is false but R is True
Reasoning - I
() For Q7 – Q10 Part of a game tree is shown below. Answer Q7 - Q10 assuming child nodes are
visited from left to right.
Text
Transcripts ()

Books ()

7) The minimax value at node V for the game tree using the Minimax algorithm is 1 point
_______.

A. 12
B. 11
C. 13
D. 16
Assessment submitted.
X 8) The alpha values at node U is ____________. 1 point

A. 11
B. 9
C. 6
D. 12

9) Given a MIN node n; cut-off search below n, if beta(n) ≤ alpha(i) for some MAX 1 point
node ancestor i of n, we have ___________ cut-off.

A. alpha
B. beta
C. deep
D. min

10) For the portion of game tree shown here, the types of cut-offs possible are: 1 point

A. Beta cut-off
B. Alpha cut-off
C. Both
D. None.

You may submit any number of times before the due date. The final submission will be
considered for grading.
Submit Answers

You might also like