Answer Submitted.

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

sandeep.chittora@gmail.com 

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

Problem solving (course)

Course
Week 2 PA - CLOSED LIST
outline Assignment not submitted
IMPORTANT: Please read the instructions carefully. For short answers your answer MUST
About FOLLOW THE FORMAT STATED IN EACH QUESTION. By default, we use COMMA as the
NPTEL () separator for entering a list of values. DO NOT ENTER ANY BLANKS, FULL STOPS, TABS,
PARENTHESIS or EXTRANEOUS CHARACTERS in the short answer. Any deviation will result in
How does an loss of marks because the answers are EVALUATED BY STRING MATCHING.
NPTEL
online Marking scheme for MCQs with more than one correct answer:
course
• Full marks, if all correct options are selected and no wrong option is selected.
work? ()
• Partial marks, if some correct options are selected and no wrong option is selected.

Pre-requisite • Zero marks, if at least one wrong option is selected.

assignment • Zero marks, if no options are selected.
()

A state space is the set of possible states. Each state can be seen as a node in an implicit graph.
Week 0 ()
A neighbourhood function we call MoveGen(N) takes a node as input and returns the neighbours
of N that can be reached in one move.
Week 1 ()

Week 2 ()

State Space
Search (unit?
unit=38&lesso
n=39)

Domain
Independent
Algorithms
(unit?
unit=38&lesso
n=40)

Deterministic
Search (unit?
unit=38&lesso
n=41)

DFS and BFS

(unit?
unit=38&lesso
n=42)

Comparing
DFS and BFS
(unit?
unit=38&lesso
n=43)
In the above diagram, the neighbours of node N are A, B, C, D, and E. The names of nodes are
Depth First
arbitrarily decided. MoveGen function returns a list of neighbours, the order in which it returns the
Iterative
neighbours depends on the implementation. The above figure suggests that the list might be [C,
Deepening
B, E, D, A], but it could also be [A, B, C, D, E] or [D, E, C, B, A] or any other order.
(unit?
unit=38&lesso
n=44) BEGIN GROUP 1: A SIMPLE STATE SPACE

Lecture
The following graph has 24 nodes, the edges are bi-directional, which means the algorithm can
Materials
move in either direction. The edges depict the MoveGen function.
(unit?
unit=38&lesso
n=46)

Quiz: Week 2
GA - State
Space
Example
(assessment?
name=265)

Quiz: Week 2
GA - CLOSED
LIST
(assessment?
name=266)

Quiz: Week 2
GA - DFS,
BFS and
DBDFS
(assessment?
name=267)

Practice: Week
BEGIN GROUP 1.1
2 PA - Lists
and Tuples
We do NOT know the order in which MoveGen generates neighbours.
(assessment?
name=270) The search algorithm does NOT maintain a CLOSED list and it adds ALL neighbours to OPEN.

Practice: Week 1) Which of the following are possible valid orders in which Depth First Search visits 1 point
2 PA - the next 5 nodes starting from J?
Assignment
and JKLOPQ
Comparison
JKLKLK
(assessment?
name=271) JNJNJN
JKPWZQ
Practice: Week
2 PA - JKPQRQ
Functions
Yes, the answer is correct.
(assessment? Score: 1
name=272)
Accepted Answers:
Practice: Week JKLKLK
2 PA - State JNJNJN
Spaces and JKPQRQ
MoveGen
(assessment? 2) Which of the following are possible valid orders in which Breadth First Search visits 1 point
name=274) the next 5 nodes starting from J?

Practice: Week JKNIEF

2 PA - OPEN
JKLOST
LIST
(assessment? JINKJJ
name=263) JKPWZQ

Practice: JIKNJE
Week 2 PA -
Yes, the answer is correct.
CLOSED LIST Score: 1
(assessment? Accepted Answers:
name=269) JKNIEF
Practice: Week JINKJJ
2 PA - Search JIKNJE
Tree
(assessment?
3) Which of the following are possible valid orders in which Depth First Search visits 1 point
name=264) the next 5 nodes starting from K?

Practice: Week KEJPOL

2 PA - State KFGHMC
Space
Example
KEBEBE
(assessment? KPQRQR
name=273) KEKEKE
Practice: Week Yes, the answer is correct.
2 PA - BFS Score: 1
Example Accepted Answers:
(assessment? KEBEBE
name=277) KPQRQR
Practice: Week KEKEKE
2 PA - DFS
4) Which of the following are possible valid orders in which Breadth First Search visits 1 point
Example
the next 5 nodes starting from K?
(assessment?
name=276)
KEJPOL
Practice: Week KJINPQ
2 PA - DFID-N
KELOPJ
Example
(assessment? KPQROS
name=278) KFLJIN
 Yes, the answer is correct.
Practice: Week Score: 1
2 PA - DFID-C
Accepted Answers:
Example
KEJPOL
(assessment?
KELOPJ
name=279)

Practice: Week
2 PA - BEGIN GROUP 1.2
Deterministic
Search – DFS/ We do NOT know the order in which MoveGen generates neighbours.
BFS/DFID The search algorithm DOES maintain a CLOSED list, and it does NOT add neighbours already
(assessment? visited (inspected) to OPEN.
name=275)
5) Which of the following are possible valid orders in which Depth First Search visits 1 point
Week 2 the next 5 nodes starting from J?
Feedback
Form: Artificial JKLOPQ
Intelligence :
JKLOST
Search
Methods For JINKLP
Problem JKPQPK
solving (unit?
JIKLEA
unit=38&lesso
n=164) Yes, the answer is correct.
Score: 1
Week 3 () Accepted Answers:
JKLOST
Week 4 () JINKLP
JIKLEA
Week 5 ()
6) Which of the following are possible valid orders in which Breadth First Search visits 1 point
the next 5 nodes starting from J?
Week 6 ()

JKNIOP
Week 7 ()
JKLOST

Week 8 () JINKLP
JKPWZQ
Week 9 () JIKNEP

Yes, the answer is correct.

Week 10 ()
Score: 1
Accepted Answers:
Week 11 () JKNIOP
JINKLP
Week 12 ()
JIKNEP

DOWNLOAD
VIDEOS () BEGIN GROUP 2: A STATE SPACE WITH CYCLES

Text The following graph has the same 24 nodes and contains additional edges that produce cycles,
Transcripts () for example E-F-K-E. This means that there may be more than one path between two nodes, for
example J-K-L-G, J-E-F-G, and many more paths exist between J and G.
Books ()

Problem
Solving
Session -
July 2024 ()

We do NOT know the order in which MoveGen generates neighbours.

The search algorithm does NOT maintain a CLOSED list and it adds ALL neighbours to OPEN.

7) Which of the following are possible valid orders in which Depth First Search visits 1 point
the next 5 nodes starting from G?

GHGLFC
GHMLFC
GLQPKL
GLQWXZ
GLQWXW

Yes, the answer is correct.

Score: 1
Accepted Answers:
GLQPKL
GLQWXW

8) Which of the following are possible valid orders in which Breadth First Search visits 1 point
the next 5 nodes starting from G?

GHGLFC
GHMLFG
GLQPKL
GLQWXZ
GFLMHC

Yes, the answer is correct.

Score: 1
Accepted Answers:
GHMLFG
GFLMHC