A* Search | A Star Search algorithm Solved Example in Artificial Intelligence by Magesh Huddar
Вставка
- Опубліковано 6 лют 2025
- A* Search | A Star Search algorithm Solved Example in Artificial Intelligence by Magesh Huddar
1. Solved Example: • 1. A star Search Algor...
2. Solved Example: • 2. A* star Search Algo...
3. Solved Example: • 3. A star Search Algor...
4. Solved Example: • A* star Search Algorit...
5. Solved Example: • A Star Search Algorith...
The following concepts are discussed:
______________________________
a star algorithm,
a* search algorithm,
a* search algoritması,
a* algorithm in artificial intelligence,
a* algorithm,
a* search algorithm in artificial intelligence,
a star algorithm example,
a* algorithm in artificial intelligence example,
a* search algoritmasıexample
********************************
Follow Us on:
1. Blog / Website: www.vtupulse.com/
2. Download Final Year Project Source Code: vtupulse.com/d...
3. Like Facebook Page: / vtupulse
4. Follow us on Instagram: / vtupulse
5. Like, Share, Subscribe, and Don't forget to press the bell ICON for regular updates
Thank you
Sir please continue doing videos
Heuristic values will be given or we should take
Given
@@MaheshHuddar Sir how can we find heuristic value if it is not given.
@@uniqueworldkrisss as the name suggests , they are heuristic values so you can select any heuristic function to determine their costs. It can be like a distance function that uses manhattan distance or euclidian distance that calculates the distance between your node and the goal node. The only important thing is your heuristic values should not be greater than actual cost values so those values cannot be completely random. If you dont know anything about the nodes(like their position in a grid ) like in the example graph and assuming the heuristic values are not given you can select their original costs as heuristic values to run A* but keep in mind that the better your heuristic values the faster your search will be
nice
they gave this problem in ai model question paper without the edge distances, was that a mistake? in the actual exam they'll always give the edge lengths and heuristic values, right?
Yeah same doubt,in mqp ,they haven't given the cost
For this question solve using greedy breadth first search sirr
Excellent explanation sir , my college teachers should learn from your teaching
In my college and other colleges there are many students suffering from this subject AI ,
Even my teachers don't know basic idea of ai 😔😔😔
@@nsc1307same heree...
Sir I have tomorrow AI Exam can you suggest you tube channel to learn CSP concept in AI
I learn the concept using your vedeos
sir how we can calculate the table that is shown in the video
That will be given
Searching: -
Searching for solutions, uniformed search strategies Breadth first search, depth first Search. Search with partial information (Heuristic search) Hill climbing, A* „AO* Algorithms, Problem reduction, Game Playing-Adversial search, Games, mini-max algorithm, optimal decisions in multiplayer games, Problem in Game playing, Apha-Beta pruning, Evaluation functions.
Sir please do videos on this topics , there is no clear explanation videos on UA-cam.