0% found this document useful (0 votes)
27 views16 pages

AIML M1 Super Important MQP Solved 1

The document discusses artificial intelligence and machine learning algorithms. It provides details about a best first search algorithm for problem solving, including pseudocode. It also discusses using machine learning techniques like simulated annealing for optimization problems.

Uploaded by

Aftab Ansari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
27 views16 pages

AIML M1 Super Important MQP Solved 1

The document discusses artificial intelligence and machine learning algorithms. It provides details about a best first search algorithm for problem solving, including pseudocode. It also discusses using machine learning techniques like simulated annealing for optimization problems.

Uploaded by

Aftab Ansari
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 16

AT-L MODULE-|

0 Dehin AT Jut task domainA AL

DAshhiuial lulligeut u Atudy of


do wing
make ouputtns do twwgs s
ho
m o h t puopu olo betten
oichat
BAanunidn Domain o AL

Mundan Fomal Expeut


COAdincuy. TaA ks T
TAKS

FoAmal Task Enginl


fcephio
Cgmputu visian Math Foult Finding
peelh, Voie Geomtr7y Manuhautuaiug
Loqic .MOnitovîLg
vtegratiou
D4holuhati an

Nahnal Lamgaa CaMes SC kttic


PhOCUT
undutomduy
Chwn kvaluysis
chackes33
Lamguaa he
- outiom
L a g uagi \ansl
atidvn
Finanttal analyAi
Ommn {use Veuitaxam
Medical og nas s
ReuAemn Thom ovíuoy
Planyt Crcakiviy
Rolyotics
Locomohve

C
State cud eXplain algeithm Of 8est First
Seauch A lqokitwn oith exampu

Algeaothim
Best First kanch CGvan Nod Staut)
?3iekity 8uele
i) Create an mpty
Paiostyue PV
) Insent ataxt in fv
P ins tt (Staat)
i) tuntil fhiohtyueut p t y
u Paioityueuu DeleteMin

f u Is qoal

tle
Fev@ath nughhouw vof u

ifvUnvisited
Malk vVigited h
Poyintet(v)
Mash v xmied"

End ?soceduiu

G
(3) Wat Jua Piobl
Tht Stote SpaLe a ) (fous, thau)
3 oR 4
h-al4 0 , 1 2
fhMu s 0 O 3
Sta&t tate (0, 0)
goal State=(a, h)
nmay b amy nUmbu ut in imuted to 3

PAoductiau Rules
bill 4
o u , tha) } ho us <K4
s u 23 il 3
1)owA thser)
ii) tow bu) it tou >0
u tuu >o tnpty 3
iv) Cheu tau )
,

3 to
V) (hou, thia) ut ost thAe 4 mp y

v(tcu uu) i hettlisu 13 Cnpy 4 to

vi) lo, thau) ub thLe 70


Cpty 3to4
Vii Chous, 0) tous So eudy 4 fo3
ix)D,2) upty 3 tO4
imphy 4 t03

to 3
i) Cesa kou)
HOn 3
+0 4
Souhion
RulA
Fo dug
3

A Simulakee Annealan
at tu
t is a vali ai ou of wU dinmbiu
, o m dooulill Mo
4Oh t plocem
DE4
way be madi
Com i u moveA múy be
Jn u beginndng
Thu idea do uoug xplo ation
nad Ou- So a t
pal
oho
five s
in helahivty ins onsi
Hna &outlon
tnPnt1 Stashug State
Can lown tm. ououtu a
$o we
By doing Qt oal moalMum plateau
Cyetting augnt

tD minimize iathin a n
ln u c we atmp
valul T objtive huntti@
Ob
MaXi 2 e
Thus this oceM ACeucln
ou oy Vaey duceudi
obleun ehanatkstica oith hesped to eusiJic

quu 2 ed
Huinhy COLnnot J
domain SperttTC
t in deal teehnia[UI
Paoduction eysteUm piovi dk
bO haplstatan u okw O F-THtN
oulvol
Sgne uisha a wwed o dehinsu
Tuat 9ut d UM 8easch phocm
Strutuu
in n &ul
Sealdh Coun lbe eutoded
Heusushnc
t p a u m deain kuowledge .
PRObQm 80wiug
Wi 80
lo we heutr hc 8eatd o a applued
ppieol
Conadenati ons
tolotolo uoing
tmfd indepiudend
DomPOs alhu u
o pAo bllwm
&mallap Subpiob@ms
of undotug ol Seps
SepsS
Possibiuh

a u OloViOuo pRo buhn


Possi biufy Di 0btning
lou aul othUa Solh: possib
othout tomfais Ok
&0luim ohuha t a state
Tpe o
O apath

Rolu o knowled tw pÁDbUn SoWIua


Natuu Oj Soluwh0u pkotu tovttu oA
use
wihOut luntuatNna oitm M
MaLhie
Tusig Teat
tuit
Alana Tmiuy }Reposed
t deteN
Puson
t t h mxnod
- i n whurha a mauns
OM twnk
lo Lendut ttn kst, 0l nud hoo peopu,
uLd a mauiu be ewatuated
Tuing Tuk piovides a dehiuwtiou 0} iuteliq enu
m a mauhiw and Wmp asA J iwtelioe
benowid w Ohamm btiu itn mpudtn
Onon A Plays 9ou o m iukeuoqatok,
A0om
uwput AM und OMn p ltm
Tu iutM ogato COUM k &ut O uwntigns
to oot n mput 4 cmd Puson X
2
yuli
hious 2 eutivia, yPd
The mtulooato6 knowi t h m
Redpo amd aimi detdet Mmins
Os 2 MdX
i Omd oko l l
PRAS

f o o l bu
macuiw
Th m oF tm
jwo outo a mto beleivi ug tuat H

eds wetutdnds tuat


m a u n i u l suCte
T mawiut
mathiuA Can Mnk
u a t A N DA tCan toD
d0
o o eod
m tnu 0qautox
tm
oot antwens
answens
wo Suts 0
ako0
wwtIM0g a a t 4ett t humam
Th wum s t
n biam
n o f kio«o
dou nof uput
tn.
m c h un h 0m
cd ahwaau
(nnot teu olo en

wntt u0qatoa
h e n LepulA aMed the
Motownpuk tn ,
Heu stt c beahcn tok 1haMUin UArrn

Stuke Sfau
A &t o states 0PAoblm
i)
opuakors to opPAake
A Set 0
blw Ctake
i) staat Omd goal State
'
T w h0A aki Ou oj eath State nodi
wned to Conid ea visihug a nodh OA not
1hs wm hoh mahiOn i ephAA uted
hunGtic funthon
But irst Seandh Cam be wed
soot nodh toX
x)>Distamt 5em
QCY) gx)+ d(x,)
du'stomu b/wX&9.
dX )
AAgonithm
APPemod&eot nodu to VIS|T
fvisIT n mpty, &ecuch had EXIn
) Get mocu tom hiad o
VIS11, cals N
q0al Staute tuun Seanch
iN1f N in m
uceeael& outpud n AAult Exit
N TD VIS[T
Puan al chdd medw Of

aJCuu O-dA 0b Cx)


i)Cao o&.
BAsadih First Se0sb
' h l s muthod no vrar gouti ons oi
aud thndot dlh quaramtted nat am
optimu
ouhion isotnd
t ot feanal{oR seasdh epau a t it La

Alg oRthm
)Cate avaAiar called u S t t s4 t to
bt taut Stabe
) Loop until a goal 9tute ii found ov
UST emp
DO
a) Rmoue hirst eltuneut em

t Mt nd Coull t
mp y, Vut

evuy pat ea kub


b) Fo cun

match fatt E, Do,


i)Apy an Aul quate a
ww Stat
ii) a nw ttote a q0al tate,
lunn us Stata.
yutt
th euu etaR
u) 0fM wtre, add
t UST
Ja IT ud 0f
FSstutr hiuat laqu , eah len
at w
heacdnd wputly buok moviua to tu
Aduoudane
uaRated ptimal golutiou (ln m 8hoR test
Ouubut o staps %eac 20al)
Cc aus att tuda qoql nodi a eu
exish

Disadvamicyt
iotonag eayui kineut dual o Ouws

Oxeefully oitu Iu dapt

Root

end 2

Ompletiu ewel , Jev) d


AtA
a a s d ouputely
w

Dapth Fist Seaidh


t edud A
1h Sean de ShatelyY s
Culeu+ path as a a rekiba rah
k atkn hoi p ot
at
h x t altumatie fat
Aoot

B
tis is
Seabud
LA
st

Alaoithm
DES Qppheo opiuatois t ah wy
qwated ttate, tyiy to cdaive diretuy
Ap ands l qcal
)I &tautiug taBe i gool tale
t aund hittn uuen
2Ofu wise Do
t stat
a) Gemnate a gutitmoi ¬
Houte no mOi Cuimo3 iqnal flus

Call Dopth Fisst-Scou oith Eas


tast tat
3ehu ned. ignas
utimte tinw Jo0p
Advotaq0:
inan olu A
Low Ato1aq heayuiiuh
deptu
asi piopoyc
Duadvomtaq
a sub optimal otukian
May hiud ou
a lbouwd
nLeute: oithout
Soluwhau en k
depth,, ma not Aind

Phodutica Sqstun'
hiutms hoapeajovig
hey s1ovide appiopiiate
aud desuihing eanc pioCust
baC LOmpeQts

thde a t ddin p cava uty


DDA u lkul ight id tuat dubt
tteiatien b b tuormael

A A databape o Cubsut iacks


estaloird duiiug h u a
A A ohel hate hat pettit

Lmuisd with f t aMd


A Aulo inug modul

DB
Aaduutiou Rulus op ake au hnooled gt
pAetoudinion, ie eitwn
a hapb a

atickied ot by Khodled DB
lam e
F PModiti au iSabihied Aul
appied
Aul Kuoledgt DB
Ayicai ouneh chamgto
T ontol n chsen ohich appica
Rul Lould re apped Ceanen
computaHior ohen a tumauahiou
touditiau u tm Knowledq DB is

Satihied
Coutkol Strakengy.
AstyateAq i deiud loy picEi
t0rda i ich nodloRxpamol
T Aeauch thatugrt a waluat ed aloua
Jn houowiug dimentiou
mp lLekenon
Timo
tomplexiH
pau tomplaxi hy
Gp mali ky
Oph2e t» uGA1 O hunhion i m hope
optimal 3ouh'am at tun eud
h 4lu na

Tic-Tac-10e Paoble
) Th Fist A peAoach
9am
t0ntuti o}
1h tic-Hac -to«
alled
nin
elemeut velt oA
a
t
6 It KephLAmk
45 P
BOAR
in tmoU
Aowt.
to
nuwbtns

00 for Blomk
for B lamk ,
valu
valuu
An elemeud wntatn t u
2 6o 0
boax CUmd
Vukon tontiits o 1188 3 (31)
A MOVE TAGLE
md 1 nueded ohu a l n Ueneid
lemenß
Uemeut vut o
a i n

AlacAuthm tinay
n
uummb
b

as a
Tun vutDA
dluma nunben
nUmbn
Vi tu
'Vew
a
dtumal
Convt f t
ud a M iudel
ldel

)Woe t diimal numb vtov


aiuem an
TABLE omd
MOVE
BOARD to s vuto inditain
i) St m move
ow m
boand dookt aft

clisoduoucHdqE) pa Gnd jo vuy dasi ult


moki
.t a ktahes
en
duimal numbi
t ind t
aucd annot
t s ho s busic awn
b&ned 60
Hil flimbi
Givn a Jonge t nput amd a
go0od
heusstic huneiouM, At biu tiond a
sabhiuty
pAOb lm
oo d Aouhigu t

wsgo ution not pe A qoo a ophmal


may
Maximum

ophmatien pAOb leml inpht


Mathemematical
h i u mbiug owto PApAolms
i we ned mapi mi2e 0%

minim 11e a qivw Lealunttian b1 uoga


valubtem. qivn mput
Heusishic eanth vnians uat Jn ealdn
algontth May not tnd t eptimal s0uhen
u n ploblum.
im
Howwe A hin os a
goo d coutiou

eatst
algoAi th m
t, adte a pASbL s o h e
expeteo
Twt

. un cuin has bleuntond

w bur Gmzdt Apioach


, feakn
in s take spau, t h
M Poi
movsn nat curtion only uw u
Suond uphoach
mwd toA BlanK

oX md 9 foa D
Th vliakk callecd TURN ndicatus 6oA r t
move os u la
ontii fso auti oni
algo algoAithm

MAKE 2 whih twns 5 t (du Seyuam


b l m k ' ofhwwse t t n i amyDbluk

en-Othu tqune 2,46.


PoSsWIIN C) Aetmns 0 i playtn p canno0
win on n t move cCnd ofwwIe otun
J muubeh t J squau thal qivu
CA WInning move

cheks eauk n wig phodut


3* 32 18 ivto a win0A X
2 50 e a Wln o 0

wina move holdu ob b lamk.

60(n) maki move r Saus n {tting


OAR D) to 3 on5
hut
moR yo wed amt taqkes Jongt
t A

uic
SwoR4IC uut dn ova
jok loua tim
t w p i att

find Appsoalh ".


Tht ttruth ch data wsists Ok
fOARD Oin ontains demit vutor, a
MppLE
potkunr spadAnd-S
uat odld
a wi 0 boatcd poslho ns a
CMd
At move
P u t hMe tun
eun tlmutian o0f
numbe y s ehg to am
lead
boaad poi hon
houw t h
play t to move
wltl mat e wiu OAn

dookt ahta d to máke o


Ts algo Atthm
detrsnCn ou ur nd mOve by deuds ug
oA
wht m mot pA0 using move
Sutablk move at my
fohen med
slme
would be md sulut
stu
all poisibu move
e ep hes
Cndd L
PAOCOm CQn mike t a t n u thut
me PUmt
Log
wl a OinnEn ntnq 2 in choon e
tw Ove tucut ead id J mpwlin
PA0g1a Loinni potsibl
hoit tim

You might also like