0% found this document useful (0 votes)
40 views20 pagesAI - Writeups - 1 To 10
Uploaded by
musicstand29Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
0% found this document useful (0 votes)
40 views20 pagesAI - Writeups - 1 To 10
Uploaded by
musicstand29Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF or read online on Scribd
/ 20
Bharati Vidyapeeth (Deemed to be University) | Name of Student Vidgad bar Daadn wk
EPARTMENT OF ENGINEERING & TECHNOLOGY | pr. 9 0UI1010G pol No: OF
Navi Mumbai - 410210, :
Class: _CSE ow.:_ TY
INDEX Subject: Avtificial Tntetle qen¢e
Sr.
sr. Name of Assignment Fae? | ate | Ma) signauro | ‘Nae
[1 |To tm plement the igo?
Tre =Tac— Toe game
uting tye Score chi $0
2:\"Ta implement +e |. |26-07|
er sug pra blem lee
= z ~
3 .\ To imple mend the 02-04 dur"
BES tn aadifical
intelle gence ( Brew +
Lisat ppavch )
4] ta teayn tu peaks, | / [05-09
Fiat ponech fav tu
given pv oblem.
S| To leaan tu bed 6-04 pa SS >
finut search Fy =
tu given poohles \
6 | To tra piement oe pees |
Ae og amit hen fo
n__opti mal coluti a
ql te solve tu doaverde SHY
ae paler man
-p aera
Clim bieg algarnith Bharati Vidyapeeth (Deemed to be University)
———————_—_—_
Name of Student :
REET Te
DEPARTMENT OF ENGINEERING & TECHNOLOGY | pry - Roll No, :
Navi Mumbai - 410210, Div. = =
Class : i’
INDEX Subject:
Se
bee a
—
sr. P ks A
No. Name of Assignment Ne | Date wey Signature | “y
7 —~
8| To implement te Lele \ |
gra ph ~Calauning i
lao cits ting {
7 ov
nideclad Scat ¢ Feet
t—Lpxa ble m
aj >
etm plemend ty
t— al
far search
zOceduce
i —praceduce |
0 Ts __dettan tHe
Sim ple expert
machine boa tye
~decepian dfece, PRN: 9043/10
Teacher's Sign.: re
oe )
Name: Vidyadhat Raf
Rolling: 05 PRA): 2049/1010 6
[Sabject: Antificiol Trdelleqences — eS
|
| Experi mend Ag+ 09
nina) Ta learns lingte adhe bilge ete aici ae
—|______problem wing artificial sndellege pice ___
c
qulep- an fi2c+ seavch
| : 2
|
I
Platfoom ted : Toe Vo cade Cnython)
Thea ry : \ later jug 1 CO eae
Search problem in +the ard? ficial tntell
Intheve the problem Statement} given two
water jug with capacities xX and y
| Y trv oy
Toitialy ‘both jugs with capacitier x and
Olto that thos ic given an
i
infinite amount af the Water 1 ep eee es
The jugs do not have Marking ¢ to
meaty7xe smaQuer
Fol id :
nae aka tthe eg —capledel ay sath a
oe tn nerd. \ pracedare
2 ei POC he aR Ne fram one lg ee eg
—OrhPy “tin et ine aioe
Hy __j'« 4c
7
Teacher's Sign,: li Sige
Ce considey the following —exasm ale —
as Ee tn delete See
[posible “tn cpa sume 0 cite Se Cee EET ESS
both jugt.
| yes & titvep — gy 8 ae
® 5 Sit 43 gz to 10145 ©
tnH?a) Stade s2f a 40) aes
goal state = $0 pG4
Fs
1 (0,0)
| A Seg
C0)
| Pe
(910) (4,3) (010)
pe ee
Gard) ee CO) eee
e. ade ree
== COMED uote
jee
eb ;
——— oe RY
rg Cee)...
Cgeot_state) Lip
concharron we trp lementecl
Lr
water (Date )
| Name “Nidyachor Rafend raprasad Mandnai ie ___
Rollno: os __ PRN ::2049 11a a6
___[Isubject 2: Addi Gciot=Tnfellegdn cows see e rs
| 2 Experimen 93 —
Aim :. what i¢ cS 9 ond. implementahian of bread th
fist seavch using: dinectany and Ieds.
Objective i: To\ understand. the «queue ike flow of
hacadth inst seanch iA artificial fntetleg er
Platform used: Tne ye code Cpython)
Seanch
problem in the aot? fio! i
| Breadth finct seaych problem aves
using the Bout farce Ap prose h Thit feayCh
technique t applicahle to” Only the tee
oqad the graphs
1s initiatl)
Inthe _hveadth Sieh ee fhe
Searching i e
then expanded furthuy tn the JSaccettor
node unthll the +eyrm; t
Nade camep.
The terminating nodes
9 Ff ECCT Fy oud p, b
-heve The Operahant of the
(poe evelea
Fivp¢ sear th ase
Shoo chure -gueu e where fray
Pitt out priacia le
Lt wed
Teacher's Algcatthens
—caeade a queuge v ul
9—_Marle vas visited andi But Virntn 1]
| 2
jes eee) \while @ i's mon - 4
—=semave head of the queue.
eee ee barre ks eee ist
ne tg hou bay
a
I Concla cian
Iale have Jeayned \ that Breacth~
9, -.
2
gueue data ae ce 70
i Name : VPdyadhor Rog mi %
| Roll no : 08 PRA: 9043110106
Subject . Ant Ficial Tndellegence
“I Exportment no - 4
al Aim. *. | (¢ , t
| and imple menting tt with + ¢tach dodo
el stoucture-
—leijecive te undevland nine Bene
salgoaithm in art ficraf ‘otellegente
Platform: sired.2. kif siead aya user ae ae
[Theory . pS Stancle far the depth Fit searvCh
o formed Search algorithm _
4 St See
the Hoe iis prob
In thi Searching technique. the last tn
last out principal i's used, So we under stoad
that the implementah'an of depth fiast cearCh
| elgorithm 's dane with the holp of the _
‘ ghacite' = dabq. “stvu rq? a er a
As {tice a BLS the depth Fivs+
$earch algonithm are alto ppliicahle to only
Jed a4 e
fa the art fiat atetlegence
Teacher's Sign.: ithm:: ed L 18 WA roid
Algorithm ia
I. Caeafe a stack :
2. Put _anly ane spei Morte an the
top_of the stack
at Take top item af the stack and om
(h tnte the vwisited pret
| rc 2
Stacie ss em . ©
oe Pod ey
“ : 5 : :
fe plemented vy Stacie data ttauchent am e: Vidy adhat Reg endraprasad ‘Dan dnas k
no: of PRN _: 9044 fiatag:
(Subject ! Astificial inte llegence
: Experiment no -08
Theory : Best fiort ceavch “ft an sInfarmed regrch
. algorithm hich fy ' wed for fearching {a
thee problem rcalyvin. meet of
¢
Cah he “atined_ 22 ee ae
which node sto he wit(ted next an the
hots _of = pott promising one
i
Heve MJ
the mast mM podmi sit f ;
bythe huerist's value - which” 1) given ef
my VC meeeerry,
Open Jic} ~ €ypanded hat not gy ek
evaluated
Closed rr} — evale
hearth ti ~
Teacher's Sign.: nod aa
i
Ui Sat ee Cloied node | Parent nade
Oo
Teacher's Sign.
=o (Page No —
(Date| )
me
Roll no: oF b PRN: 2043110106
Subject : Astificiat Tndellegente 6
|
Banpttenens® Now O: ee eee
Aim: t
using — hill climbing algorithm
fo the hill climbing
Platform used : The we code. :
Then Travelling salesman aablem aske fow the
_shontest+ voute +o visit the collectian of
cities and weduynin tn the starting —p.
+ is the NP hare| pvoblem means we do nat
give —ut the _gurandeed _bec+ talutian fos
ol) the problems oe th ees Cott polynomial time
Local seaych algorithm Saanich
immediase [ neighbouring node)
Mrotmuny Ctravel)
oss
