HILL CLIMBING ALGORITHM IN ARTIFICIAL INTELLIGENCE | CSE&IT TUTORIAL

preview_player
Показать описание
Hill Climbing Algorithm in Artificial Intelligence
Hill climbing algorithm is a local search algorithm which continuously moves in the direction of increasing elevation/value to find the peak of the mountain or best solution to the problem. It terminates when it reaches a peak value where no neighbor has a higher value.
Hill climbing algorithm is a technique which is used for optimizing the mathematical problems. One of the widely discussed examples of Hill climbing algorithm is Traveling-salesman Problem in which we need to minimize the distance traveled by the salesman
Features of Hill Climbing:
Generate and Test variant
Greedy approach
No backtracking
Different regions in the state space landscape:
Local Maximum
Global Maximum
Current state
Flat local maximum
shoulder
Types of Hill Climbing Algorithm:
Simple hill Climbing:
Steepest-Ascent hill-climbing:
Stochastic hill Climbing:
Problems in Hill Climbing Algorithm
1. Local Maximum:
2. Plateau:
3. Ridges:
Рекомендации по теме
Комментарии
Автор

Life lo firsttime, inthaa clarity expination choodam.. Awesome 🤩🤩

epgsk
Автор

Thanks madam...
For ur
Hill climbing tech. In pure Telugu...
I understood completely madam.
I like ur way of teaching.. This is my first of ur video mada.
I don't know ur great name madam.
Pl. Give video on A*, AO, algo madam
To understand the technique and it's application s.
Hope u make above video for us.
Athma Ram. K.
Ongole.

athmaram
Автор

Sister...tnx for ur lectures.Complete ga ardamypoindi concept..

shaheenashaik
Автор

Me voice chala bagundi...and clear ga undi

dindigalasrividhya
Автор

Mee slang kooda exam ki meru cheppinde rsthunna you miss

ushakirancharming