0% found this document useful (0 votes)
12 views10 pagesAiml Practical 123
The document discusses the Fibonacci sequence, explaining its recursive definition and how to generate it using iterative and recursive approaches. It also touches on algorithms related to pathfinding, specifically A* and its efficiency in navigating mazes. Additionally, it mentions the use of chatbots powered by machine learning to enhance user interactions.
Uploaded by
Ram ChaskarCopyright
© © 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)
12 views10 pagesAiml Practical 123
The document discusses the Fibonacci sequence, explaining its recursive definition and how to generate it using iterative and recursive approaches. It also touches on algorithms related to pathfinding, specifically A* and its efficiency in navigating mazes. Additionally, it mentions the use of chatbots powered by machine learning to enhance user interactions.
Uploaded by
Ram ChaskarCopyright
© © 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
/ 10
AIML(D
Syeahions. - daswer
What I's fibonacei se. sles, and howys yt
jererated %_ a. .
2 Exbonace! series 34 sequence. of
numbers whese each aumber 715 the sum of
the -two prece sting ones. Tt slayts Loitth oandz
the seqyeNce 5: 0,),2,3, 5,8, an
Ec) ie : =
F(N) = FOon-1) + FCn- 2
fet nN ee
S:2)|| compare, the i'beralive andre cuvaeiv:
___Lappreaches_to generating tne Pibsnace |
SEL
——F Recursive Approach 1 Uses fun cHen_colls
te _calovlate FCA) based.on f=) anol
El are et
2S +e Easy to ample ment.
sy -
igh Hime’ CBmmpleaity oC.) and
can —_lead_+te stack “averflovo fer
Laqcge_2. es tt Lc ReE AS
P) Creratve, Appreach ic Uses i S and.
Pere. ‘2
variables: to Glove prenous vests
= More 2ff're nd, votth A ny,
easel Oca)
Antsy a are, coraplew. fee =
3 : than wecursten
@ scanned with OKEN Scanner ie. |
SD Wike a program t 2 And dhe. nth _fibongey~
“Cl
Number _u. Ag. yecursive Mxadhod, _ —
Jef fibona cel. v2 quas've. cap a
{En ee a: i.
eR OF
ef Aaco=ls a a2 a
eeryen LS, 17,
else}
Ab = fihonectt wecyrsive Ca-)) +
Avon ace rec ufive (ez),
aetyrn fib
Ne inkCiopur ("Eater -n: 7")
priate CHU the. $03. Ma Aibonace} Aumbert's >
£ Aborreccireeursive (py)
Dyadoot gre dre apelicatlone of the fbofae.}
SEG YANO L. {A wealr woorfel ROI SK 2
Sy computes al gona (29. dena ng}c
BroGro tse jhe = otting techniques)
Ana f eter. mnodeling Cey. precdiching =
Steck pace s).,
@ scanned with OKEN Scanner —_|D Nature Ceggaramg 2melt- of [eqa-es,—
oa Pcheceaching” of Aiees, shell s picols)—
@ scanned with OKEN Scanner JALML ©)
| Cue sbions—Aaswey ——
* algorithm and_ how dees.
Ax jlas4 rats algorithm 9 ——
«-algowtthm sob populty= path finding
and grea A tecavienesa |alg exthm used to! ee
| pre. Shove Sk path from a sterting node
to_aterg ek Node. Tf combine the benefit:
of. DV\est¥a!s algomthm and Greedy —
Ges = fivst_search by umifg beth! he_actua|
cast 16 seo ch__a_nadeC35-Gad a_heen'h'c
esiMaute (in) of dhe Gaxt 42 red ch pre?
goo 4 :
A% uses the evaluation funetHen -
FCO) = 39) 4 hoo)
= a
S Staring node to whe currents neoce, _
Wen)t= The eartimated ost Cheurrish'c.) 40
aceach tne goal -Grom phe Current Bade.
[£00 Toka\ estimated cost of the Patty
Yhorgy}, se Cure Oede
AX Algexttnho " Ovkstrq! cll yarn)
OG lises path a ckval Lock Gs ( O_censidecs only. dre
ancl|_heamst estan je| a@huctl_casd-—C95_fo—
Sa) to prtordiiae Nedke { areach_nedec? -
More ef Ac\ent \ ASS eiclent a
Sophia) _epes-ulte— Aluowy = produces _
4E bre aye srt re tees
@ scanned with OKEN Scanner —~ 5.2) fe ou ing the. vole. of heamohic funchions
=a see. ae ancton