A* algorithm in AI (artificial intelligence) in HINDI | A* algorithm with example

43 thoughts on “A* algorithm in AI (artificial intelligence) in HINDI | A* algorithm with example”

1. thanks sir

2. Bro you’re best. Love from Pakistan 🇵🇰❤️💯

3. You're awesome sir
   I always check your videos before my exam😊 you're handsome too😅

4. thnks brother for teaching

5. Nice explanation sir🙏🙏

6. please confirm me that you are Punjabi
   and erase my confusion.
   BTW love from PAK

7. Thank you❣️

8. Thannku sir

9. Thank you so much bhaiya

10. Awsome

11. No one can explain such topic like you have done.
    thanks bhai❤❤

12. excellent explanation sir

13. Thank u so much sir

14. Thank u so much sir….You are a very good teacher😊😊☺ & explain all topics in easier way…You are brilliant…You saved my semester…. I'm from Pakistan💚.

15. Good one.

16. How you calculated heuristic values.you didn't mention .

17. Thanks bro….GOD BLESS YOU….💓💓

18. U are very good looking

19. Sir h(n) value given hogi ya find karni padegi ,,,agar find karni hai toh kaise karenge x,y wale concept se difficult hoga plz sir isko clear kar de ,,thanks in advance sir ,,,plz reply

20. Join Scaler Academy by InterviewBit, India's 1st job-driven online tech-versity.
    
    Accelerate your tech skills in 6-months and land a job at the top tech companies globally.
    
    300+ of our students have landed jobs with an salary range of 18-35 LPA at 150+ companies that include Google, Amazon & Microsoft.
    
    No upfront payment. Pay us only after you get a high-paying job.
    
    Live interactive online classes three days a week at night-time. Attend classes from the comfort of your home, even while working full-time
    Visit our website: website link:https://bit.ly/3aZskvx
    Follow us on Youtube: https://www.youtube.com/c/ScalerAcademy
    
    Follow us on LinkedIn: https://www.linkedin.com/school/scaleracademy/

21. Sir, what would be the branching factor in this example?

22. What if the f->g cost is 1? Then this example does not give optimal solution, even after considering the heuristic value.

23. Three ways to go the goal state for possible paths are:–
    SCDEG = 17 minimum cost
    SBEG = 21 midium cost
    SBFG = 25 higher cost

    Final ans is that
    = 17 minimum cost

24. Thanks sir

25. salute from pakistan to this guy……My AI is dedicated to him

26. Sir the ya search algorithms ha ya complete hothy ha ya uncomplete please sir explain with example

27. Sir, estimated cost to go on goal node ko hme calculate karna hoga best first search se ho jaega na?

28. Sir optimal solution and huristic me kya antr h

29. A* is complete ?? Is that statement is true or false??

30. easy maze solving AI by this guy https://youtu.be/MmOQZkcD1-o

31. Must watch: https://www.youtube.com/channel/UCXqjxIgOAVqjM0FD2U64JiQ?view_as=subscriber

32. Explanation style is very nice. Impressive Bro

33. ویلڈن

34. Thanks sir g 👍

35. I love it when you say 'Jiro' <3

36. Had the goal be E, then should we've added the heuristic value in the goal state in final calculation?

37. Sir, how can the distances between 'c' , 'd' , 'e' is possible. Because these node made a triangle, and acc. to triangle property , sum of two sides is greater than third side (7+2<10).

38. Superb mahh..

39. This is GD method 👍

40. Thanks a lot

41. Sir how i can implement A* algorithm in programming

42. Sir u are amazing person and teaching method is awesome after watching your tutorial all problems are solved and realize that Artificial Intelligence is too much easy….Very well done sir and thank you so much for being this type of teacher….. regards.

43. Good Explanation

Comments are closed.