A * ALGORITHM IN ARTIFICIAL INTELLIGENCE WITH EXAMPLE

This video will clear all your doubts regarding A * algorithm in Artificial Intelligence with examples.

[@sonali9696]

Good explanation and good voice!

[@abudimutamba]

Thank for sharing 🔥

[@saeedabdollahi8203]

how do you visit a node like B two times?

[@ashutoshdurgule4011]

make videos on Machine learning MU engineering

[@poornachander-gq1bz]

thx so much for explaining clearly

[@haeckerzz]

when you website is coming sadiasiddiqui???

[@shaikshaiksha4763]

How to find heuristic value mam

[@sujalbalar316]

Heuristic values are given

[@akshaykumar192]

heristic valuse diya rahta hai kya ?

[@RajKumar-r1q3o]

Thank you so much

[@godofwar8262]

🏩pink 🤞🏽

[@DaltonStephen]

i need a video on how heuristic value is calculated

[@ranupandey3639]

Best explanation of A* algo! Thanks ma'am!

[@tetr4182]

When did you cross S ==> A?

[@tsk1217]

she forget to cross the S => A initially , the right time to cross it when you use the S => A and move forward .

[@maitryghag6619]

Heuristic value please

[@nageswarnandipati682]

Love the way you explained ! Simple & easily understandable 💟 Within 10 minutes, I came to know what A* Algo is 💟

[@factwithhunny078]

Your voice is mindblowing❤

[@moshe-dm8wv4pb2t]

Heuristic values meru ela thisukunaru

[@CR0WS_ZR0]

What to do if heuristic value is not provided?

[@ahmedsarker3555]

7:09 why didnt we use S->A->D

[@gouthamraj3178]

because it is already reached the goal node and it is not the shortest path

[@applelover4734]

can u teach us react full course with advanced concepts

[@moshe-dm8wv4pb2t]

What's Madam ela ala

[@sankard9280]

mam here b is already explored na mam so how can we choose s->a->b mam

[@ankitpal8044]

I have a very urgent doubt please solve it asap Iterative A* search and iterative deepning A* search has same algorithm

[@ankitpal8044]

Please solve it 🙏 😔

[@applelover4734]

Iterative A* search and iterative deepening A* search are related concepts, but they are not exactly the same. Let me explain both concepts and provide you with a simple Python implementation for each. 1. **Iterative A* Search:** Iterative A* search is an improvement over the traditional A* search algorithm. A* (A-star) search is a popular graph traversal and pathfinding algorithm that efficiently finds the shortest path between two points on a graph. Iterative A* search is an enhancement to the A* algorithm where it uses an iterative deepening approach to improve its performance. Here's a simplified Python implementation of Iterative A* Search: ```python def iterative_a_star_search(graph, start, goal): max_depth = 0 while True: result = a_star_search(graph, start, goal, max_depth) if result is not None: return result max_depth += 1 def a_star_search(graph, start, goal, max_depth): # Your A* search implementation goes here # Use max_depth as a limit for the depth of the search # Return the result or None if no path is found within the given depth # Example usage: # result = iterative_a_star_search(graph, start_node, goal_node) ``` 2. **Iterative Deepening A* Search:** Iterative Deepening A* search is a combination of the Iterative Deepening Depth-First Search (IDDFS) and A* search algorithms. It repeatedly performs depth-limited searches, gradually increasing the depth limit until a solution is found. Here's a simplified Python implementation of Iterative Deepening A* Search: ```python def iterative_deepening_a_star_search(graph, start, goal): depth_limit = 0 while True: result = a_star_search(graph, start, goal, depth_limit) if result is not None: return result depth_limit += 1 def a_star_search(graph, start, goal, depth_limit): # Your A* search implementation goes here # Use depth_limit as a limit for the depth of the search # Return the result or None if no path is found within the given depth # Example usage: # result = iterative_deepening_a_star_search(graph, start_node, goal_node)

[@Tan-db3qn]

life saver i watched like 4 videos and none of them made sense came across yours and was saved thank you smmmmm

[@arduinoide2165]

Perfect

[@hemanthsai905]

Thanks for your explanation

[@Husdajukies]

thank you queen finally I understand

[@afrazhussain3778]

good explanation with cool voice

[@dewmi4403]

I guess you were in PICT

[@ctcrnitv]

excellent video, strange name for a computer science youtube channel

[@crackconcepts]

Couldn't come up with a better name 😂

[@agathisekar3112]

I need theory part

[@ionkhan]

we need a complete course you teach better

[@keerthigadhanaskaran2752]

thank you very helpful

[@AliRaza-ei1mt]

samaj agya

[@shannish3947]

good explanation

[@black_godfred]

❤️❤️❤️

[@sachinpratapsingh2250]

far better than gate smasher

[@umeshgolla2730]

I have been asking you to take a course on alogorithms and database..