9/4/24, 10:08 PM Artificial Intelligence : Search Methods For Problem solving - - Unit 11 - Week 7

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

[email protected] 

NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Artificial Intelligence : Search Methods For

Problem solving (course)

Course Week 7 Practice Assignment:

outline
Game Tree 1
About Assignment not submitted
NPTEL () Note : This assignment is only for practice purpose and it will not be counted towards the
Final score
How does an
NPTEL The figure shows a 4-ply game tree with evaluation function values at the horizon. The nodes in
online the horizon are assigned labels A,B,C,...,P. Use these labels when asked to enter a horizon
course
node or a list of horizon nodes. The internal nodes are labeled in a level-by-level left-to-right
work? ()
manner:

Pre-requisite
Max root : a1
assignment
Min level: b1,b2
()
MAX level: c1,c2,...,c4
MIN level: d1,d2,...,d8
Week 0 ()
Horizon (MAX) level: A,B,C,...,P

Week 1 ()
Tie-breaker: when several nodes have the same h-value then select the deepest leftmost node.

Week 2 ()

Week 3 ()

Week 4 ()

Week 5 ()

Week 6 ()

Week 7 ()

https://onlinecourses.nptel.ac.in/noc24_cs88/unit?unit=86&assessment=326 1/4
9/4/24, 10:08 PM Artificial Intelligence : Search Methods For Problem solving - - Unit 11 - Week 7

Game Theory
(unit?
unit=86&lesso
n=87)

Popular
Recreational
Games (unit?
unit=86&lesso
n=88)

Board Games
and Game
Trees (unit?
unit=86&lesso
n=89)

The
Evaluation
Function in
Board Games 1) What is the MinMax value of the game?
(unit?
unit=86&lesso
Enter a number.
n=90)
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Algorithm
Minimax and Answer format: 42
Alpha-Beta
Pruning (unit?
unit=86&lesso 1 point
n=91)
2) List the horizon nodes in the best strategy.
A Cluster of
Strategies
Enter the node labels as a comma separated list in ASCENDING order.
(unit?
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
unit=86&lesso
n=92)
Answer format: A,B,C
SSS*: A Best
First
Algorithm 1 point
(unit?
unit=86&lesso 3) List the horizon nodes pruned by alpha-cuts.
n=93)
Enter the node labels as a comma separated list in ASCENDING order.
SSS*: A
Detailed NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Example
(unit? Answer format: A,B,C
unit=86&lesso
n=94)
1 point
Lecture
Materials 4) List the horizon nodes pruned by beta-cuts.
(unit?
unit=86&lesso
Enter the node labels as a comma separated list in ASCENDING order.
n=96)
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Practice:
Week 7

https://onlinecourses.nptel.ac.in/noc24_cs88/unit?unit=86&assessment=326 2/4
9/4/24, 10:08 PM Artificial Intelligence : Search Methods For Problem solving - - Unit 11 - Week 7

Practice Answer format: A,B,C

Assignment:
Game Tree 1
(assessment? 1 point
name=326)
5) When AlphaBeta(root,-INF,+INF) is invoked, it passes the (alpha,beta) bounds to
Practice:
descendants, where the bounds are updated with values received from horizon nodes.
Week 7
Practice
Find the first internal node whose alpha and beta bounds are assigned finite values.
Assignment:
Game Tree 2
(assessment? Enter the node label, alpha and beta values as a comma separated list.
name=324) NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.

Quiz: Week 7 :
Answer format: b3,4,5
Assignment 7
(assessment?
name=325)
1 point
Week 7
Feedback
6) List the horizon nodes in the initial clusters formed by SSS*, as discussed in the lecture.
Form:
Artificial Tie Breaker: when several nodes have the same h-value then select the deepest leftmost node.
Intelligence :
Search Enter the node labels as a comma separated list in ASCENDING order.
Methods For NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Problem
solving (unit?
Answer format: A,B,C
unit=86&lesso
n=169)

DOWNLOAD 1 point
VIDEOS () 7) What are the horizon nodes that are assigned SOLVED status by SSS*?

Text Tie Breaker: when several nodes have the same h-value then select the deepest leftmost node.
Transcripts
()
Enter the node labels as a comma separated list in ASCENDING order.
NO SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS.
Books ()

Answer format: A,B,C

Problem
Solving
Session - 1 point
July 2024 ()

Strategy in two player games

After reviewing the lectures, watch this incredible analysis by the former World chess champion
Garry Kasparov (https://www.youtube.com/watch?v=SMe-hvCwTRo
(https://www.youtube.com/watch?v=SMe-hvCwTRo)). In his analysis, observe how Kasparov is
actually traversing a strategy level by level in a game tree, similar to what Construct-Strategy-
Max does. It is amazing how a complex analysis is captured by a simple and elegant procedure.

GothamChess reviews Garry Kasparov’s game here https://www.youtube.com/watch?v=Ty-

16QZubRA (https://www.youtube.com/watch?v=Ty-16QZubRA).

https://onlinecourses.nptel.ac.in/noc24_cs88/unit?unit=86&assessment=326 3/4
9/4/24, 10:08 PM Artificial Intelligence : Search Methods For Problem solving - - Unit 11 - Week 7

Hikaru premoves an entire game and wins, wow!: https://www.youtube.com/watch?v=QZ7-

8MntaEo (https://www.youtube.com/watch?v=QZ7-8MntaEo).

Now, it must become clear why a strategy is defined the way it is defined.
Thumbs Up.

Check Answers and Submit

https://onlinecourses.nptel.ac.in/noc24_cs88/unit?unit=86&assessment=326 4/4