ASSIGNMENT OF ARTIFICIAL INTELLIGENCE

Q. 1 Artificial intelligence has been in existence for a few decades. Name few
devices from decades. Also state there capabilities?

Ans-: In 1952-1962 author Samuel (IBM) wrote the first game playing program for checkers to
achieve sufficient space to challenge the world champion. Machine learning program were
responsible for high performance of the checkers players.

In 2000 interactive robots become commercially available. The most famous was SONY
AIBO.MIT shows off KISMET, a robot to express expressions. Nomad named robor was
capable of exploring areas of Antartica and locates meteorites.

In 2002 a prototype of the past robotic plane designed specifically for combat mission flew to
7500 feet and reached a top speed of 224 mph during its successful flight.

Q.2 Turing test has often been as being of whether or not a person could
distinguish between responses from a computer and responses from a person?
Five questions that Turing test fails?

Ans-:

q.1 Is the egg rotten or not ?

q.2 Is the flower kept in the front artificial or real ? etc etc

Q3. Discuss state space representation for the following problems:

Three missionaries and three cannibals come to a river. There is a boat on their
side of the river that can be used by either one or two persons. How should they
use this boat to cross the river in such a way that cannibals never outnumber
missionaries on either side of the river?

Four persons are standing on one end of the river from which two are children
and one is mother and another one is father. Both of children having weigh of
40kg and mother is of 60kg and father is of 80kg.A boat is available in which can
take a maximum of 100kg weight How will they arrange o cross the river?

Ans-: The first thing is the state and rules we have to define

(X, Y)

X=Missionaries, y=Cannibals

X1 on this side of the bridge, X2 on the side of the bridge

Condition State Action

1. (X1, Y1)
If (x1= =y1) (3X1, 3Y1) Send 1 missionary and 1
cannibal to
Other side of the bridge

2. (X2, Y2)

If(X2= =Y2) (2X2, 2Y2) Send two missionaries on the

other
Of the bridge
3. (X1, Y1)

If(X1= =0) (0X1, 3Y1) Send the two

cannibals on the boat
On the other side
of the bridge

4. (X1, Y1)
If (Y1-X1= =1) (1X1, 2Y1) Get the cannibal
into the boat

5. (X2, Y2) (3X1, 0Y1) Send two

missionaries on the other
 Side of the
bridge

If (Y1= =0)

6. 1. (X1, Y1)
If (x1= =y1) (3X1, 1Y1) Send 1 missionary and 1
cannibal to
Other side of the bridge

This side of Bridge That side of bridge Rule

Applied

(3X1, 3Y1) (0X2, 1Y2) 1

(2X1, 2Y1) (1X2, 1Y2) 6

(3X1, 0Y1) (0X2, 3Y2) 3

(2X1, 0Y1) (1X2, 3Y2) 3

(0X1, 0Y1) (3X2, 3Y2) 3

(b)
(X, Y)

C=weight of child, M=weight of mother F=weight of father

X1 on this side of the river, X2 on the side of the river

Condition State Action

1. (2C, 1M, 1F))

If ((c+c) <=100) (0C, 0M, 0F)) Send 2child and to
other
Side of the river
2. (1C, 1M, 1F)

If(C+M) <=100) (1C, 0M, 0F) Send mother on other side

of
the river

3. (1C, 0M, 1F)

If (F<= 100) (1C, 1M, 0F) Send father alone

on the river and
Arrive back with
child on it

4. (2C, 0M, 0F)

If ((2*C) <=100) (0C, 1M, 1F) Send the two
child’s on the other
side of the river

This side of River That side of River Rule

Applied

(2C, 1M, 1 F) (0C, 0M, 0 F) 1

(1C, 1M, 1 F) (1C, 0M, 0 F) 2

(1C, 0M, 1F) (1C, 1M, 0F) 3

(0C, 0M,0F) (2C, 1M, 1F) 4

Q4. Given a 5-litre jug filled with water and an empty 2-litre jug, how can one
obtain precisely 1-litre in the 2-litre jug? Water may either be discarded or
poured from one jug to another; however, no more than the initial 5 liters is
available.

Ans-:-: The first thing is the state and rules we have to define

(X, Y)

X=Jug containing 5 liter water, Y=Jug containing 2 liter

Condition State Action

1. (X, Y)
If(X<=5)  (5, Y) Pour 2litre in Y

2. (X, Y)

If(X>=3)  (X-1, Y+2) Pour 2litre in Y

3. (X, Y)

If(Y= =2) (X, Y-2) Discard
the water from 2 liter Jug

4. (X, Y)
Pour 1 Liter to Y
If(Y==1)  (X-1, Y+1)

5 Liter Jug 2 Liter Jug Rule

Applied

5 0 1

3 2 3

3 0 2

1 2 3
0 1
4
Q5 Write a program to implement:

Breath –First Search

Function breadth ( )
{
Q=[ ]
State = root-node
While
(true)
{
If is _goal
(state)
Than
Return success
Else
Add_to_back_of_q(successors(state));
If q= [ ]

than a report failure ;

state = q[0];
\\ state = first item in q
Remove _first _item _from (q);
}
}
Q6. Provide the definition of the word “heuristic”. In what ways can heuristic be
useful in search? Name three ways in which you use heuristic in your everyday
life?

Ans-: The dictionary meaning of heuristic is” the theory that a learner should learn should
discover for himself”. Heuristic algorithms are not intelligent. They appear because they perform
better .They have the advantage of feedback from data to direct the searchpath.Informed search
algorithms use heuristic functions that are specific to problem apply them to guide the search
space to try to reduce the amount of time spent in searching.

Three ways we use heuristic in every day life

*We need to find the shortest path while traveling (good solution not best solution)

* Puzzle solving in shortest best possible way.

*Chess playing in which move may be a good one may not it best move.