Artificial Intelligence Search Method Assignment Solution

9/19/22, 8:38 PM Artificial Intelligence : Search Methods For Problem solving - - Unit 5 - Week 2

(https://swayam.gov.in)

(https://swayam.gov.in/nc_details/NPTEL)
kamalakarbapanapalli@gmail.com 
NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL)
»
Artificial Intelligence : Search Methods For
Problem solving (course)

Register for
Certification
exam
Week 2 : Assignment 2
(https://examform.nptel.ac.in/2022_04/exam_form/dashboard)
The due date for submitting this assignment has passed.
Due on 2022-08-10, 23:59 IST.
Course
outline Assignment submitted on
2022-08-09, 20:19 IST
Refer to Week 2 Notes before attempting this assignment.
How does an

NPTEL
In general, to reduce clutter in state space diagrams, the bi-directional edges will be drawn
online
without arrow heads (as undirected edges) and uni-directional edges will be drawn with a single
course
arrow head. For example, the following two state spaces are equivalent:
work? ()

Pre-requisite
Assignment
()
Week 0 ()

Week 1 () GROUP 1

Week 2 () In the lecture, 8-5-3 Water Jug puzzle was discussed. In this assignment, we will work with 10-7-
3 Water Jug puzzle.
State Space
Search (unit? There are three jugs A, B and C of capacities 10L, 7L and 3L, respectively. Only two types of
unit=38&lesson=39) actions (operations or moves) are permitted: empty a jug into another jug, or fill a jug to its brim.
Domain By using only these moves, the state space (subspace) reachable FROM (0, 7, 3) state is shown
Independent below.
Algorithms
(unit? The objective of Group 1 questions is for you to manually explore this subspace and use it as a
unit=38&lesson=40) starting point to answer the questions that follow.

https://onlinecourses.nptel.ac.in/noc22_cs67/unit?unit=38&assessment=179 1/9
Deterministic
Search (unit?
unit=38&lesson=41)
DFS and BFS

(unit?
unit=38&lesson=42)
Comparing
DFS and BFS
(unit?
unit=38&lesson=43)
Depth First
Iterative
Deepening
(unit?
unit=38&lesson=44)
Lecture
Materials
(unit?
unit=38&lesson=46) You can also ponder about what kind of algorithms will find the answers sought, when they do
Week 2
not have the global viewpoint that a visual graph gives us humans. The search algorithms have
Feedback access only to a MoveGen function. Also, ponder about how to write a MoveGen for water jug
Form: puzzle.
Artificial
Intelligence : Answers to Q1 to Q5 are integers. DO NOT ENTER DECIMAL POINT, SPACES, TABS,
Search COMMAS OR EXTRANEOUS CHARACTERS.
Methods For
Problem 1) Starting from (0, 7, 3), what is the least number of moves required to reach (5, 5, 0)?
solving (unit?
unit=38&lesson=164) 9
Quiz: Week 2 Yes, the answer is correct.

Score: 1
: Assignment
2 Accepted Answers:
(assessment? (Type: Numeric) 9
name=179)
1 point
Lecture
2) Starting from (5, 5, 0), what is the least number of moves required to reach (0, 7, 3)?
Materials -
Week 2 (unit?
2
unit=38&lesson=180)
Yes, the answer is correct.
Week 3 () Score: 1
Accepted Answers:
Week 4 () (Type: Numeric) 2
1 point
Week 5 ()
3) What is the total number of states reachable from (0, 7, 3) via zero, one or more moves?
Week 6 ()
2
Week 7 () No, the answer is incorrect.

Score: 0
Week 8 () Accepted Answers:
(Type: Numeric) 20
Week 9 () 1 point
DOWNLOAD 4) Starting from (0, 7, 3), what is the least number of moves required to reach a state like (1, *,
VIDEOS () *)?
5
Text
Transcripts () Yes, the answer is correct.
Score: 1
Books () Accepted Answers:

(Type: Numeric) 5
Problem 1 point
Solving
Session () 5) Starting from (0, 7, 3), what is the least number of moves required to measure a whole 6
liters?

3

Score: 1
Accepted Answers:
(Type: Numeric) 3
1 point
6) We want to reach (0, 7, 3) from other states. From which of the following states can 1 point
we achieve (0, 7, 3)? The selected states must satisfy the jug capacity constraint.

(5, 5, 0)

(8, 1, 1)

(6, 2, 2)

(8, 2, 0)
Partially Correct.
Score: 0.5
Accepted Answers:
(5, 5, 0)
(8, 1, 1)
(6, 2, 2)
(8, 2, 0)
7) Note, only a subspace is shown in the figure above. This subspace can be extended1 point
by adding new states (with whole number water levels adding up to 10L and satisfying the jug
capacity constraints) and by adding new transitions. What is true about the full state space of the
10-7-3 Water Jug puzzle?

Each move is reversible

Every state is reachable from every other state

There is at least one state that has no outgoing edges

There is at least one state that has no incoming edges
No, the answer is incorrect.

Score: 0
Accepted Answers:
There is at least one state that has no incoming edges
8) What information is available in Week 2 notes (in 2 PDF files) uploaded to the 1 point
course page? See Lecture Materials link under Week 2.

How to model a problem as a state space search problem?

Some properties of state spaces

DFS, BFS algorithms, ancillary functions

DFID-1, DFID-2 algorithms

About node order and tie breaking rule

Examples of list and tuple operations

Score: 1
Accepted Answers:
How to model a problem as a state space search problem?
Some properties of state spaces
DFS, BFS algorithms, ancillary functions
DFID-1, DFID-2 algorithms
About node order and tie breaking rule
Examples of list and tuple operations
GROUP 2

Use the DFS and BFS algorithms provided in Week 2 Notes to answer questions in this group
and in subsequent groups. These algorithms will be used in the final exam as well. In DFS and
BFS, a new node is added to OPEN only if it is not already present in OPEN/CLOSED.

More importantly, pay attention to the order in which nodes are opened and closed by the
algorithms. The answers depend on the order in which nodes are processed and how the list is
created and read by the algorithms.

A state space and a corresponding MoveGen is shown below. The start state is S and the goal
state is G.

Manually, run DFS and BFS on this problem and draw the respective search trees, then answer
the following questions.
9) Four search trees associated with the above state space are shown below, where 1 point
the open nodes are white filled and the closed nodes are blue filled. The search trees are shown
for the case when the goal test has passed and the algorithm has ended.

Identify the DFS search tree.

Search Tree 1

Search Tree 2

Search Tree 3

Search Tree 4

Score: 1
Accepted Answers:
Search Tree 1
10) Identify the BFS search tree? 1 point

Search Tree 1

Search Tree 2

Search Tree 3

Search Tree 4

Score: 1
Accepted Answers:
Search Tree 3
GROUP 3

A state space and a corresponding MoveGen is given below. Here S is the start node and G is
the goal node. Manually, run DFS and separately BFS until the goal is found, then answer the
following questions. Note that a new node is added to OPEN only if not already present in OPEN
or CLOSED.

MUST FOLLOW: In your answer, the order of nodes from OPEN/CLOSED list should follow the
order in which the list is maintained by the algorithm. Refer Week 2 notes for details.
11) At the instance when BFS finds G, the CLOSED list is ____________ .

The CLOSED list contains node pairs (NODE, PARENT), enter only the NODE labels from head
to tail as a comma separated list; if the CLOSED list is empty or is undefined then enter NIL. DO
NOT ENTER SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer
format: A,B,C
D,C,B,A,S

Score: 1
Accepted Answers:
(Type: String) D,C,B,A,S
1 point
12) What is the path found by BFS?

Enter the NODE labels, from start to goal, as a comma separated list. DO NOT ENTER
SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format:
A,B,C
G,D,B,S

Score: 0
Accepted Answers:
(Type: String) S,B,D,G
1 point
13) At the instance when DFS finds G, the CLOSED list is ____________ .

The CLOSED list contains node pairs (NODE, PARENT), enter only the NODE labels from head
to tail as a comma separated list; if the CLOSED list is empty or is undefined then enter NIL. DO
NOT ENTER SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer
format: A,B,C
D,C,A,S

Score: 1
Accepted Answers:
(Type: String) D,C,A,S
1 point
14) What is the path found by DFS?

Enter the NODE labels, from start to goal, as a comma separated list. DO NOT ENTER
SPACES, TABS, DOTS, BRACKETS OR EXTRANEOUS CHARACTERS. Answer format:
A,B,C
G,D,C,A,S

Score: 0
Accepted Answers:
(Type: String) S,A,C,D,G
1 point

GROUP 4

Consider two variations of Depth First Iterative Deepening (DFID) algorithm:

● DFID-1 opens only new nodes (not already in OPEN/CLOSED) in each iteration.
● DFID-2 opens new nodes and also reopens nodes in CLOSED that are currently not in
OPEN.
** When we say that an algorithm “opens” a node, we mean that: after the node is generated by
MoveGen, that node is added to OPEN when the required conditions are met.

Use the DFID algorithms given in Week 2 notes. Run the two algorithms on the state space
shown here (reproduced from the previous section).

15) What is the path found by DFID-1?

Enter the path (starting from S) as a comma separated list of node labels. If a path is not found
then enter NIL. DO NOT ENTER SPACES, TABS, BRACKETS OR EXTRANEOUS
CHARACTERS. Answer format: A,B,C
S,B,D,G

Score: 0
Accepted Answers:
(Type: String) NIL
1 point

Enter the path (starting from S) as a comma separated list of node labels. If a path is not found
then enter NIL. DO NOT ENTER SPACES, TABS, BRACKETS OR EXTRANEOUS
CHARACTERS. Answer format: A,B,C
S,B,D,G

Score: 1
Accepted Answers:
1 point
17) Select all correct statements. 1 point

If there is a path to the goal, DFID-1 always finds it.

If there is a path to the goal, DFID-1 returns the shortest path.



None of the above.
Score: 0
Accepted Answers:
GROUP 5
18) What data-structures are used to store OPEN nodes, in BFS and DFS algorithms, 1 point
respectively?

Stack, Queue

Stach, Stack

Queue, Stack

Queue, Queue

Score: 1
Accepted Answers:
Queue, Stack
19) Which of the following are configuration problems? 1 point

5-Queens

8-Puzzle

Map coloring

'Man,Lion,Goat,Cabbage' Problem

Rubik's Cube

Travelling Salesman Problem (TSP)
Partially Correct.
Score: 0.67
Accepted Answers:
5-Queens
Map coloring
20) For INFINITE state spaces that have a path from start to goal, which of the following 1 point
algorithms will always find a path?

DFS

BFS

DFID-1

DFID-2

Score: 0
A dA
Accepted Answers:
BFS
DFID-2
21) For FINITE state spaces that have a path from start to goal, which of the following 1 point
algorithms will always find a path?

DFS

BFS

DFID-1

DFID-2

Score: 0
Accepted Answers:
DFS
BFS
DFID-2
12/22/2020 Artificial Intelligence Search Methods For Problem Solving - - Unit 5 - Week 2
(https://swayam.gov.in) (https://swayam.gov.in/nc_details/NPTEL)
NPTEL (https://swayam.gov.in/explorer?ncCode=NPTEL) » Artificial Intelligence Search Methods For Problem Solving
(course)
Announcements (announcements) About the Course (preview) Ask a Question (forum)
Progress (student/home) Mentor (student/mentor)
Unit 5 - Week 2
Course outline
How does an
Assignment 2
NPTEL online The due date for submitting this assignment has passed. Due on 2020-09-30, 23:59 IST.
course work? As per our records you have not submitted this assignment.
Pre-requisite
Assignment Several problems of interest can be modeled as a state-space search problem. This is how it is done:
choose a problem, determine what constitutes a STATE (a written representation of the state-of-existence),
Week 0 identify the START STATE and the GOAL STATE(S), identify the operations/actions/moves that cause a
STATE to change, then write down the STATE TRANSITIONS as a function (or program module) that maps
Week 1 a STATE to a set of NEIGHBORING STATES, a.k.a. MoveGen or neighborhood function
Week 2 In state space search a solution is found by exploring the state space with help of neighbourhood function:
begin at the start state and keep expanding until a goal state is found.
State Space
Search (unit?
unit=14&lesson=129) State spaces are used to represent two kinds of problems. In configuration problems the task is to find a
goal state that satisfies some properties. In planning problems the task is to find a path to a goal state.
Domain
The sequence of moves in the path is a plan.
Independent
Algorithms (unit?
unit=14&lesson=130) State spaces have properties:
Deterministic
Search (unit? Extent: state spaces may be finite or infinite.
unit=14&lesson=131)
DFS and BFS Exponential Growth: finite state spaces may be very very large — exponential and beyond. And the
(unit? search space associated with a search algorithm may increase exponentially with depth
unit=14&lesson=132)
Comparing DFS Branching Factor: may be constant or bounded or finite or large-and-finite

and BFS (unit?
unit=14&lesson=133)
Reversible: some state spaces are reversible, i.e., every STATE TRANSITION is REVERSIBLE. Most
Depth First real world problems do not have this property, but have regions that are reversible, and regions that
Iterative are not, and in sum total it is not reversible.
Deepening (unit?
unit=14&lesson=128)
Connectedness: All kinds of connectivity from graph theory apply here. The whole state space may
Week 2- be completely connected, or may have several connected components which are mutually disjoint. A
Feedback : search algorithm can only explore the connected component in which the start node lies. The 8-puzzle,
Artificial for example, has two disjoint connected components, and the Rubik’s cube has twelve
Intelligence
Search Methods
for problem Metric Spaces: States (and/or transitions) may provide a metric (say Euclidean distance, Manhattan
Solving (unit? distance, etc.) as a measure of fitness or direction or distance to a goal state.
unit=14&lesson=18)
Lecture BEGIN GROUP: Q1 – Q8

Materials (unit?
unit=14&lesson=173) Water jug puzzle: A seven litre jug is filled with water, you are required to divide it into 1 + 5 + 1 litres. You
Quiz : may use two empty jugs of size 5 and 2 litres for this purpose. There is no other way of measuring water
Assignment 2 except by the size of the jugs, i.e., one can either empty a jug into another or fill another jug to its brim
(assessment?
name=179)
Week 3
Figure 1:
Week 4
Week 5
Model this puzzle as a state-space search problem. A state is represented by a tuple (A,B,C), where A is
the amount of water in the 7L jug, B is the amount of water in the 5L jug and C is the amount of water in the
Week 6
2L jug. The tuple notation is illustrated in Figure 1.
Week 7 The initial state is (7,0,0), if you transfer water from 7L jug to 5L jug we reach (2,5,0) state, and if you
transfer the remaining water from 7L jug to 2L jug we reach (0,5,2) state. Now we can reverse these two
Week 8 transfers. A state-space expresses all valid states and their transitions. Now, build the state-space for the
water jug puzzle and answer the following questions
Week 9
ATTENTION: Answers to Q1 thru Q7 are integers. DO NOT include spaces, tabs, periods or non-numeric
Week 10 characters in the text box.
Week 11 1) Starting from (7,0,0), what is the least number of transfers/moves required to reach (1,5,1)?
Week 12
Score: 0
DOWNLOAD
Accepted Answers:
VIDEOS
(Type: Numeric) 6
1 point
2) Starting from (1,5,1), what is the least number of transfers/moves required to reach (7,0,0)?

Score: 0
Accepted Answers:
(Type: Numeric) 2
1 point
3) How many paths from (1,5,1) to (7,0,0) have the minimum length found in question 2?

Score: 0
Accepted Answers:
(Type: Numeric) 2
1 point
4) What is the size of the state-space (number of states) in 7-5-2 water jug puzzle?

Score: 0
Accepted Answers:
(Type: Numeric) 14
(Type: Numeric) 18
1 point
5) Starting from (7,0,0), what is the least number of transfers required to measure 6 litres?

Score: 0
Accepted Answers:
(Type: Numeric) 5
(Type: Numeric) 4
1 point
6) Starting from (7,0,0), what is the least number of transfers required to measure 4 litre?

Score: 0
Accepted Answers:
(Type: Numeric) 3
(Type: Numeric) 2
1 point
7) Starting from (7,0,0), what is the least number of transfers required to measure 3 litres?
N h i i

Score: 0
Accepted Answers:
(Type: Numeric) 2
1 point
8) Which of the following is true about the state-space of water jug puzzle? 0 points
State-space is reversible
All seven volumes from 1L to 7L are measurable
There is at least one state that has no outgoing edge
There is at least one state that has no incoming edge
Score: 0
Accepted Answers:
END GROUP: Q1 – Q8
9) Four state spaces and one MoveGen is shown below. 1 point
Here (as well as in all state space diagrams in this assignment), to reduce clutter, two-way edges are shown
without arrowheads and one-way edges are shown with arrowheads.
Mark the correct options.
The MoveGen describes State Space 1

None of these.
Score: 0
Accepted Answers:
10)A state space and four MoveGen functions are given below 1 point
Mark the correct options
The spate space is described by MoveGen-1

None of these
Score: 0
Accepted Answers:
BEGIN GROUP: Q11 – Q15
Use the given DFS and BFS algorithms to answer questions in this group. Observe that in these algorithms
a new node is added to OPEN only if it is not present in either OPEN or CLOSED.
A MoveGen and its graphical representation is given below. Here S is the start node and G is the goal
node. Now, run DFS and separately BFS until the goal is found, then answer the questions in this group
Note: The given DFS and BFS algorithms maintain node-pairs in OPEN and CLOSED lists. Therefore,
when typing the contents of OPEN or CLOSED list in the textbox, type the list as comma separated node-
pairs (without using spaces, tabs, period or other symbols), for example: (A,S),(B,S),(S,null)
Note: In your answer the order of nodePairs in OPEN/CLOSED should be as constructed, i.e., the
rightmost entry is the first nodePair added, and the leftmost is the last. This is consistent with how the
Cons operator “:” constructs lists.
Note: If OPEN or CLOSED list is empty then enter NA in the textbox.
11)When DFS finds G, the CLOSED list is _____

Score: 0
Accepted Answers:
(Type: String) (D,A),(C,A),(A,S),(S,null)
(Type: String) ((D,A)(C,A)(A,S)(S,NA))
(Type: String) (D,A),(C,A),(A,S),(S,nil)
1 point
12)When DFS finds G, the OPEN list is _____

Score: 0
Accepted Answers:
(Type: String) (G,D),(B,S)
(Type: String) ((G,D)(B,S))
1 point
13)When BFS finds G, the CLOSED list is _____

Score: 0
Accepted Answers:
(Type: String) (D,A),(C,A),(B,S),(A,S),(S,null)
(Type: String) (D,A),(C,A),(B,S,)(A,S),(S,null)

(Type: String) (D,A),(C,A),(B,S),(A,S),(S,nil)
(Type: String) (D, A), (C, A), (B, S), (A, S), (S, null)
(Type: String) (D,A),(C,A),(B,S),(A,S),(S,null))
(Type: String) (D,A),(C,A),(B,S)(A,S),(S,null)
1 point
14)When BFS finds G, the OPEN list is _____

Score: 0
Accepted Answers:
(Type: String) (G,B)
1 point
15)Based on your responses to Q11-14, which of the following statements are true? 1 point
When DFS finds G, B is in CLOSED

When DFS finds G, B is still in OPEN
When BFS finds G, B is in CLOSED
When BFS finds G, B is still in OPEN
Score: 0
Accepted Answers:
When DFS finds G, B is still in OPEN
When BFS finds G, B is in CLOSED
BEGIN GROUP: Q16 – Q20
Consider two variations of DEPTH FIRST ITERATIVE DEEPENING (DFID) where DFID-1 opens only new
nodes (nodes not in OPEN and CLOSED are opened), and DFID-2 allows CLOSED nodes to be reopened
and does not reopen the OPEN nodes. Run the two variations on the following state space which has S as
the start node and G as the goal node.
16)What is the path found by DFID-1?
In the textbox, enter the path as a comma separated list starting from node S, enter only the node
labels, do not enter node pairs, for example: S,A,B,C (and DO NOT use spaces, tabs, period or other
characters in the path).

Score: 0
Accepted Answers:
(Type: String) S,A,C,E,G
1 point
17)What is the path found by DFID-2?
In the textbox, enter the path as a comma separated list starting from node S, enter only the node labels,
do not enter node pairs, for example: S,A,B,C (and DO NOT use spaces, tabs, period or other characters in
the path).

Score: 0
Accepted Answers:
1 point
18)For depth bound 3, DFID-1 invokes GoalTest ______ times

Score: 0
Accepted Answers:
(Type: Numeric) 6
(Type: Numeric) 15
1 point
19)For depth bound 3, DFID-2 invokes GoalTest ______ times

Score: 0
Accepted Answers:
(Type: Numeric) 16
(Type: Numeric) 15
(Type: Numeric) 26
(Type: Numeric) 27
1 point
20)Select the correct statements 1 point
If there is a path to the goal, DFID-1 always finds it

If there is a path to the goal, DFID-1 returns the shortest path
None of these
Score: 0
Accepted Answers:
10/25/21, 7:46 AM Artificial Intelligence Search Methods For Problem Solving - - Unit 5 - Week 2
Answer Submitted.
X


»
Artificial Intelligence Search Methods For
Problem Solving (course)
Course
outline Week 2 : Assignment 2(Non
How does an
Graded)
NPTEL online Assignment not submitted
course work?
Water jug puzzle: A seven litre jug is filled with water, you are required to divide it into 1 + 5 + 1
litres. You may use two empty jugs of size 5 and 2 litres for this purpose. There is no other way
of
Pre-requisite measuring water except by the size of the jugs, i.e., one can either empty a jug into another
or fill
Assignment
another jug to its brim
Week 0
Week 1 Figure 1:

Week 2
State Space
Search (unit? Model this puzzle as a state-space search problem. A state is represented by a tuple (A,B,C),
where
unit=38&lesson=39) A is the amount of water in the 7L jug, B is the amount of water in the 5L jug and C is the
amount of
water in the 2L jug. The tuple notation is illustrated in Figure 1.
Domain

Independent
The initial state is (7,0,0), if you transfer water from 7L jug to 5L jug we reach (2,5,0) state, and
if
Algorithms
(unit?
you transfer the remaining water from 7L jug to 2L jug we reach (0,5,2) state. Now we can
reverse
unit=38&lesson=40) these two transfers. A state-space expresses all valid states and their transitions.
Now, build the
state-space for the water jug puzzle and answer the following questions
Deterministic
Search (unit?
ATTENTION: Answers to Q1 thru Q7 are integers. DO NOT include spaces, tabs, periods or
non-
unit=38&lesson=41)
numeric characters in the text box.
DFS and BFS 1) Starting from (7,0,0), what is the least number of transfers/moves required to reach
(1,5,1)?
(unit?
unit=38&lesson=42)
1
Comparing No, the answer is incorrect.
Score: 0
DFS and BFS
(unit?
Accepted Answers:
unit=38&lesson=43)
(Type: Numeric) 6
Depth First 1 point

Iterative
2) Starting from (1,5,1), what is the least number of transfers/moves required to reach
(7,0,0)?
Deepening
(unit?
1
unit=38&lesson=44)
Week 2 Score: 0
Feedback
Accepted Answers:
Form: Artificial
(Type: Numeric) 2
Intelligence
Search 1 point
Methods for
problem 3) How many paths from (1,5,1) to (7,0,0) have the minimum length found in question 2?
Solving (unit?
unit=38&lesson=45) 1
Lecture No, the answer is incorrect.
Materials Score: 0
(unit? Accepted Answers:
unit=38&lesson=46) (Type: Numeric) 2
Practice: Week 1 point

2 : Assignment
2(Non Graded)
4) What is the size of the state-space (number of states) in 7-5-2water jug puzzle?
(assessment?
1
name=164)
Quiz: Week 2:
Score: 0
Assignment 2
Accepted Answers:
(assessment?
(Type: Numeric) 14
name=163)
(Type: Numeric) 18
Week 3
1 point
Week 4 5) Starting from (7,0,0), what is the least number of transfers required to measure 6 litres?
1
Week 5
Week 6 Score: 0
Accepted Answers:
Week 7 (Type: Numeric) 5
(Type: Numeric) 4
Week 8 1 point
Week 9 6) Starting from (7,0,0), what is the least number of transfers required to measure 4 litre?
1
N h i i
Week 10 Score: 0
Accepted Answers:
(Type: Numeric) 2
Week 12 1 point
DOWNLOAD 7) Starting from (7,0,0), what is the least number of transfers required to measure 3 litres?
VIDEOS
1
Text Transcripts No, the answer is incorrect.
Score: 0
Books Accepted Answers:
(Type: Numeric) 2

1 point
8) Which of the following is true about the state-space of water jug puzzle? 0 points

State-space is reversible




Score: 0
Accepted Answers:
Check Answers and Submit
Your score is: 0/7


»
Artificial Intelligence Search Methods For
Problem Solving (course)
Course
outline Week 2: Assignment 2
The due date for submitting this assignment has passed.
How does an Due on 2021-08-18, 23:59 IST.
NPTEL online As per our records you have not submitted this assignment.
course work?
Refer to Week 2 Notes before attempting Week 2 Assignment.
Pre-requisite
Assignment BEGIN GROUP 1
Week 0 Water jug puzzle: There are 3 jugs A, B and C of capacities 6L, 5L and 3L, respectively. Only
two
types of actions/operations/moves are permitted: empty a jug into another jug, or fill a
jug to its brim.
Week 1
The reachable subspace (the state space reachable from (0, 5, 3)) for the water jug problem is
Week 2 shown below. Bold undirected edges represent reversible two way moves. The objective of
Group 1
questions is for you to manually explore this space, and answer the questions that
follow.
State Space
Search (unit?
You can also ponder about what kind of algorithms will find the answers sought, when they
do not
unit=38&lesson=39)
have the global viewpoint that a visual graph gives us humans. The search algorithms
have access
Domain only to a MoveGen function. Also, ponder about how to write a MoveGen for
water jug puzzle.
Independent
Algorithms
(unit?
unit=38&lesson=40)
Deterministic
Search (unit?
unit=38&lesson=41)
DFS and BFS

(unit?
unit=38&lesson=42)
Comparing
DFS and BFS
(unit?
unit=38&lesson=43)

Depth First
Iterative
Deepening
(unit?
unit=38&lesson=44)
Week 2
Feedback
Form: Artificial
Intelligence
Answers to Q1 thru Q6 are unsigned integers. DO NOT ENTER ANY DECIMAL POINT,
SPACES,
Search
TABS, COMMAS, OR EXTRA CHARACTERS IN THE TEXT BOX.
Methods for
problem 1) Starting from (0, 5, 3), what is the least number of moves required to reach (4, 4, 0)?
Solving (unit?
unit=38&lesson=45)
Lecture No, the answer is incorrect.
Materials Score: 0
(unit? Accepted Answers:
unit=38&lesson=46) (Type: Numeric) 5
Practice: Week 1 point
2 : Assignment
2(Non Graded) 2) Starting from (4, 4, 0), what is the least number of moves required to reach (0, 5, 3)?
(assessment?
name=164)
Quiz: Week 2: No, the answer is incorrect.
Assignment 2 Score: 0
(assessment? Accepted Answers:
name=163) (Type: Numeric) 2
Week 3 1 point
3) What is the total number of states reachable from (0, 5, 3) via zero, one or more moves?
Week 4
Week 5
Score: 0
Week 6 Accepted Answers:
(Type: Numeric) 14
Week 7
1 point
Week 8 4) Starting from (0, 5, 3), what is the least number of moves required to reach (6, y, z) where y
and z can be any values?
Week 9
N h i i
Week 10 Score: 0
Accepted Answers:
1 point
Week 12
5) Starting from (0, 5, 3), what is the least number of moves required to measure 4 litres?
DOWNLOAD
VIDEOS
Text Transcripts Score: 0

Accepted Answers:
Books (Type: Numeric) 4
1 point

6) Starting from (0, 5, 3), what is the least number of moves required to measure 1 litre?
Score: 0
Accepted Answers:
(Type: Numeric) 3
1 point
7) Starting from (0, 5, 3), what is the least number of moves required to reach (3, 3, 2)? 1 point

3 moves

4 moves

5 moves

Not reachable
Score: 0
Accepted Answers:
Not reachable
8) Which of the following is true about 6-5-3 water jug puzzle’s Reachable Subspace (see 1 point
Notes) of the state space?

The entire Reachable Subspace is reversible


All six volumes from 1L to 6L can be measured


Score: 0
Accepted Answers:
All six volumes from 1L to 6L can be measured
END GROUP 1
BEGIN GROUP 2
Use the DFS and BFS algorithms described in the Week 2 notes to answer questions in this
group
and in subsequent groups. These algorithms will be used in the final exam as well.
Note that a node
is added to OPEN only if it is not already present in OPEN or CLOSED.
More importantly, pay attention to the order in which nodes are opened and closed by the
algorithms. The answers depend on the order in which nodes are processed and how the list
is
constructed and read by the algorithms.
A state space and a MoveGen that generates it is shown below. The start state is S and the
goal
state is G.
Run DFS and BFS on this problem and draw the respective search trees, then answer the
following
questions.
9) Four search trees associated with the above state space are shown below, where the 1 point
open nodes are white filled and the closed nodes are blue filled. The search trees are shown for the
case when the goal test has passed and the algorithm has ended.
Identify the DFS search tree.

Search Tree 1

Search Tree 2

Search Tree 3

Search Tree 4

None of the above.
Score: 0
Accepted Answers:
Search Tree 4
10) Identify the BFS search tree? 1 point

Search Tree 1

Search Tree 2

Search Tree 3

Search Tree 4

None of the above.
Score: 0
Accepted Answers:
Search Tree 2
END GROUP 2
BEGIN GROUP 3
A state space and a MoveGen is given below. Here S is the start node and G is the goal node.
Note
that MoveGen determines the order in which neighbours are generated. Hand simulate
DFS and
separately BFS until the goal is found, then answer the following questions.
MUST FOLLOW: In your answer, when entering the contents of either OPEN or CLOSED list,
type
the list as comma separated node-pairs. DO NOT ENTER SPACES, TABS OR OTHER
SYMBOLS
OR EXTRA CHARACTERS. Answer format: (A,S),(B,S),(S,null)
If the OPEN or CLOSED list is empty then enter NIL in the textbox.
MUST FOLLOW: In your answer, the order of nodePairs from OPEN/CLOSED list should
follow the
order in which the list is maintained by the algorithm, i.e., from left to right, where
the leftmost entry
is the recent one and the rightmost entry is the oldest one. This is
consistent with how the Cons
operator “:” constructs lists.
11) At the instance when BFS finds G, the CLOSED list is _____ .
Score: 0
Accepted Answers:
(Type: String) (E,C),(D,B),(C,A),(B,S),(A,S),(S,null)
(Type: String) E,D,C,B,A,S
1 point
12) At the instance when BFS finds G, the OPEN list is _____ .
Score: 0
Accepted Answers:
(Type: String) (G,D),(F,E)
(Type: String) G,F
1 point
13) At the instance when DFS finds G, the CLOSED list is _________ .
Score: 0
Accepted Answers:
(Type: String) (F,E),(E,C),(C,A),(A,S),(S,null)
(Type: String) F,E,C,A,S
1 point
14) At the instance when DFS finds G, the OPEN list is _________ .
Score: 0
Accepted Answers:
(Type: String) (G,E),(D,C),(B,S)
(Type: String) G,D,B
1 point
15) Based on your responses to Q11-14, which of the following statements are true? 1 point

When BFS finds G, F is in CLOSED.

When BFS finds G, F is still in OPEN.

When DFS finds G, F is in CLOSED.

When DFS finds G, F is still in OPEN.
Score: 0
Accepted Answers:
When BFS finds G, F is still in OPEN.
When DFS finds G, F is in CLOSED.
END GROUP 3
BEGIN GROUP 4
Consider two variations of Depth First Iterative Deepening (DFID) algorithm: DFID-1 opens**
only
new nodes (nodes not already in OPEN or CLOSED) in every iteration, and DFID-2 opens
new
nodes and also reopens nodes in CLOSED and not in OPEN.
** When we say that an algorithm “opens” a node, we mean that after the node is generated
by
MoveGen, it is added to OPEN if the given conditions are met.
Refer Week 2 notes for DFID algorithms.
Run the two variations on the given search space where S is the start node and G is the goal
node.
Move order is from left to right.
labels, do not enter node pairs. DO NOT ENTER SPACES, TABS OR OTHER SYMBOLS OR
EXTRA CHARACTERS.
Answer format: A,B,C
Score: 0
Accepted Answers:
(Type: String) S,A,C,E,G
1 point
labels, do not enter node pairs. DO NOT ENTER SPACES, TABS OR OTHER SYMBOLS OR
EXTRA CHARACTERS.
Answer format: A,B,C
Score: 0
Accepted Answers:
1 point
18) For only depth bound 3, DFID-1 invokes GoalTest ______ times.
Score: 0
Accepted Answers:
(Type: Numeric) 6
1 point
19) For only depth bound 3, DFID-2 invokes GoalTest ______ times.
Score: 0
Accepted Answers:
(Type: Numeric) 15
1 point
20) Select the correct statements. 1 point





None of these.
Score: 0
Accepted Answers:
END GROUP 4
Artificial Intelligence Search Methods for probl... https://onlinecourses.nptel.ac.in/noc18_cs51/uni...
reviewer3@nptel.iitm.ac.in ▼
Courses » Artificial Intelligence Search Methods for problem Solving
Announcements Course Ask a Question Progress Mentor FAQ
Unit 4 - Week 2
Course outline Assignment 2

How to access the The due date for submitting this assignment has passed. Due on 2018-08-15, 23:59 IST.
portal As per our records you have not submitted this assignment.
Pre-requisite
Assignment
Topics: State Space Search: Depth First Search, Breadth First Search, DFID
Week 1
NOTE: Wherever you are required to type in the answer (instead of clicking on a button) please
Week 2 DO NOT ENTER ANY BLANKS. This is the assessment is evaluated by a program that does exact
string matching. An extra blank in the answer will result in even a correct answer being
Introduction to
state space search
evaluated as wrong.
Search: DFS and This “no blanks” policy will hold THROUGHOUT this course.
BFS
1) Which of the following algorithm(s) always terminate(s) on a finite search space? 1 point
Search: DFID
Quiz : Assignment DFS

2
BFS
Week 2- Feedback
: Artificial DFID
Intelligence Search
Methods for None of the above
problem Solving
Score: 0
Week 3
Accepted Answers:
Week 4 DFS
BFS
Week 5 DFID
Week 6 2) Which of the following search algorithm(s) always find(s) a path to the goal (if there 1 point
exists one) in a finite search space.
Week 7
DFS
Week 8
BFS
Week 9 DFID
None of the above

Week 10
Week 11 Score: 0
Accepted Answers:
Week 12
DFS
BFS
Solutions
DFID
Video Download 3) Which of the following search algorithm(s) always find(s) a path to the goal (if there 1 point
© 2014 NPTEL - Privacy & Terms - Honor Code - FAQs -

A project of In association with Funded by
Powered by
1 of 6 Thursday 08 November 2018 04:23 PM

None of the above

Score: 0
Accepted Answers:
BFS
DFID
4) Mark the algorithm(s) for which space requirements grow linearly with depth. 1 point
DFS
BFS
DFID
None of the above

Score: 0
Accepted Answers:
DFS
DFID
5) Mark the algorithm(s) that always find(s) the shortest path from start state to goal state 1 point
in any search space.
DFS
BFS
DFID
None of the above

Score: 0
Accepted Answers:
BFS
DFID
6) Which of the following is/are configuration problem(s)? 1 point
8-Puzzle
Boolean Satisfiability Problem (SAT)
5-Queens
Rubik's Cube
'Man, Lion, Goat, Cabbage' Problem

Score: 0
Accepted Answers:
Boolean Satisfiability Problem (SAT)
5-Queens
Figure 2.1 depicts a search space in which the nodes are labeled with names like A,
B, C, and D. Node S is the start node, and G is the goal node.
For the questions below please enter the answer as a sequence of nodes separated by a
comma. Please DO NOT enter any blanks. For example, if the answer (order of nodes) is A
followed by C, followed by F, followed by G, the answer should be - Answer: A,C,F,G
7)

List the order in which the Depth First Search algorithm inspects the nodes in Figure 2.1. Wherever
there is a contention between more than one node the algorithm chooses one on the left (as seen
by us)

Score: 0
Accepted Answers:
(Type: String) S,A,D,K,M,O,F,G
1 point
8) What is the path found by the algorithm in the previous question?

Score: 0
Accepted Answers:
(Type: String) S,A,D,K,M,O,G
1 point
9) What is the path found by the algorithm Breadth First Search for the problem in Fig 2.1?

Score: 0
Accepted Answers:
(Type: String) S,B,G
1 point
10)What is the path found by the algorithm DFID in the previous question?

Score: 0

Accepted Answers:
1 point
Figure 2.2 depicts a search space in which the nodes are labeled with names like A,
B, C, and D. Node S is the start node. The goal nodes are drawn as square boxes and
the other nodes in circles.
11)
List the order in which the Depth First Search algorithm explores the graph till termination,
searching from left to right.

Score: 0
Accepted Answers:
(Type: String) S,A,D,K,U,V,L
1 point
12)What is the path found by the algorithm in the previous question?

Score: 0
Accepted Answers:
(Type: String) S,A,D,L
1 point
13)List the order in which the Depth First Search algorithm explores the graph till termination,
searching from right to left.


Score: 0
Accepted Answers:
(Type: String) S,C,J,T,R,I
1 point

Score: 0
Accepted Answers:
(Type: String) S,C,I
1 point
15)List the order in which the Breadth First Search algorithm explores the graph till termination,
searching from left to right.

Score: 0
Accepted Answers:
(Type: String) S,A,B,C,D,E,F,G
1 point

Score: 0
Accepted Answers:
1 point
17)List the order in which the Depth First Iterative Deepening (DFID) algorithm explores the graph
till termination, searching from left to right.

Score: 0
Accepted Answers:
(Type: String) S,S,A,B,C,S,A,D,E,B,F,G
1 point

Score: 0
Accepted Answers:
1 point
Previous Page End


Artificial Intelligence Search Method Assignment Solution

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Artificial Intelligence Search Method Assignment Solution

Uploaded by

Copyright:

Available Formats

9/19/22, 8:38 PM Artificial Intelligence : Search Methods For Problem solving - - Unit 5 - Week 2

Problem solving (course)

DFS and BFS

Quiz: Week 2 Yes, the answer is correct.

Week 7 () No, the answer is incorrect.

Books () Accepted Answers:

Yes, the answer is correct.

No, the answer is incorrect.

Yes, the answer is correct.

Identify the DFS search tree.

Yes, the answer is correct.

10) Identify the BFS search tree? 1 point

Yes, the answer is correct.

Yes, the answer is correct.

12) What is the path found by BFS?

No, the answer is incorrect.

Yes, the answer is correct.

14) What is the path found by DFS?

No, the answer is incorrect.

(Type: String) S,A,C,D,G

Consider two variations of Depth First Iterative Deepening (DFID) algorithm:

15) What is the path found by DFID-1?

No, the answer is incorrect.

16) What is the path found by DFID-2?

Yes, the answer is correct.

17) Select all correct statements. 1 point

Yes, the answer is correct.

19) Which of the following are configuration problems? 1 point

No, the answer is incorrect.

No, the answer is incorrect.

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

Announcements (announcements) About the Course (preview) Ask a Question (forum)

Progress (student/home) Mentor (student/mentor)

Comparing DFS Branching Factor: may be constant or bounded or finite or large-and-finite

Lecture BEGIN GROUP: Q1 – Q8

No, the answer is incorrect.

No, the answer is incorrect.

No, the answer is incorrect.

No, the answer is incorrect.

No, the answer is incorrect.

No, the answer is incorrect.

9) Four state spaces and one MoveGen is shown below. 1 point

Mark the correct options.

The MoveGen describes State Space 1

Mark the correct options

The spate space is described by MoveGen-1

BEGIN GROUP: Q11 – Q15

Note: If OPEN or CLOSED list is empty then enter NA in the textbox.

11)When DFS finds G, the CLOSED list is _____

No, the answer is incorrect.

12)When DFS finds G, the OPEN list is _____

No, the answer is incorrect.

13)When BFS finds G, the CLOSED list is _____

No, the answer is incorrect.

(Type: String) (D,A),(C,A),(B,S,)(A,S),(S,null)

14)When BFS finds G, the OPEN list is _____

No, the answer is incorrect.

When DFS finds G, B is in CLOSED

END GROUP: Q11 – Q15

BEGIN GROUP: Q16 – Q20

16)What is the path found by DFID-1?

No, the answer is incorrect.

17)What is the path found by DFID-2?