Hey well academy sorry I don't know your name BTW I want to thanks to you. Your all video helps me alot in my exams. I'm very very thankful to you Thank you so much. I attempted my AI paper very easily just coz of you otherwise 3 days before I was tensd for my exams. You are doing great job 👌❤
i have one dought jo start node se goal node tk phuchne ke liye aapne bich me phle hi nodes generate kar rakhe ha to A* algo. me kya sabhi nodes phle hi generate hote ha kya goal node tk, ya jo minimum heuristic value wale node generate hone ke bad agle node generate hote ha. or ye heuristic value randomly generate hoti ha ya kisi problem ke liye hme khud ko count karke deni padti ha
If we calculate S -> A = 7 and S -> B = 6 The algorithm will search forward from B right, it won't go back to A because it got best between A and B as B. please help
These are the best explanation i ever got for Algos. I really Appreciate the way you have explained the Algo. Also i have seen multiple videos on various other Algos. Great work guys.
In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected graph. en.m.wikipedia.org/wiki/Tree_(graph_theory)
![GUILTY GEAR -STRIVE- Season Pass 4 Playable Character #1 [Queen Dizzy] Trailer](http://i.ytimg.com/vi/nXDsAgYXXv4/mqdefault.jpg)
every time before exam your vedio become very helpful to my all group........
ohh sachi yaar
Exam from 11.00am and I m watching at 9.00am. :v
tnx
@@Alone-fx6uh You are a true engineer my friend \m/
Bhai Video hota hai 😂😂😂
Nicely explained, inspiring to see a young tutor like you.
Thanks sir for your help in this topic
You are like a saviour to us in studying during exams time
Thank you so much Sir. Your videos are a big reason that I got my AI cleared :)
Sir ismy agr direct qstion pucha jata hai ... To kya hueristic value particular point k liye given hogi ya khud s nikalni jogi?
you are amazing ....thanks for such a priceless lectures. hope to see more from you. thank you so much
UR efforts are great. U MADE AI so easy. Dear, teachers like U are always honoured.
Hey well academy sorry I don't know your name BTW I want to thanks to you. Your all video helps me alot in my exams. I'm very very thankful to you Thank you so much. I attempted my AI paper very easily just coz of you otherwise 3 days before I was tensd for my exams. You are doing great job 👌❤
thank you for keeping the lectures free,short and to the point.you should do more definitely !
A very clear and easy to understand demonstration.
i have one dought
jo start node se goal node tk phuchne ke liye aapne bich me phle hi nodes generate kar rakhe ha to A* algo. me kya sabhi nodes phle hi generate hote ha kya goal node tk, ya jo minimum heuristic value wale node generate hone ke bad agle node generate hote ha.
or ye heuristic value randomly generate hoti ha ya kisi problem ke liye hme khud ko count karke deni padti ha
thanku for helpful videos i have seen many videos on utube but nly urs is understandable thanku nd plz keep giving more.
Double Thanks bhai iss video k wajhe se mere friend ka exam aacha Gaya aur woh pass ho jayega uss taraf se Thhaannkk you!!! u rock bro 😀👍
tu kabhi nahi sudhrega chetan sharma
We can use this to estimate the interest of unique visitors. Like- guessing next food/restaurant/article/item my customer would like to choose.
your way of teaching is very gd.. thank u
The heuristic values are calculated right? Should h(n) of A be 5.
Thnku for the topic easy to explain ...
Follow us on :
Facebook : facebook.com/wellacademy/
Instagram : instagram.com/well_academy
Twitter : twitter.com/well_academy
Meri tou teacher bhi apkay lectures dekh kr parhati hai 😁 nice and thanks
hahahahah
Haha
lolzzzzzzzzzzzzzzz
Same here
Phir teacher change karo
I think the heuristic value for A should be 5... Please correct me if I am wrong...
Preparing for insem exam of final year computer engineering?
@@groundknowledge5989 Yes dude...
Wah!! Bahut msst samjaye h aap,,
Thanku SirG
Is it compulsory to cover all the nodes till goal node in a*?
What if both nodes values are equal at any point? Then which path we should follow?
it would have been helpful if you could provide an example at the end for students to solve themselves
In this we can draw and given our own values,it will work
Is there any condition that all the nodes should be visited atleast once?
nothing can be good than this. awesome brother thank you
Shailesh Chandra lol
Thankyou bhaiya .....great job
You said we avoid path which are already expensive but I didn't understand that statement according to your example ....
Ur video is very helpfull to me
nice video....and easy to learn ....seriously.... and very helpful....thank u ...
please guide me after watching these video lecture what I am doing.
Can you tell me how to find heuristic value for each node in the graph given in the video??
Great explanation sir🙏🙏👍
nice video....and easy to learn AI.
Wonderful video, but could you please share how to write the algorithm as well along with the keywords, it'll be really helpful.
Thanks
bhai heuristic value kaise find kiya mere exam mai given nahi tha direct question the "state and explain the a* algo with example.
Bro in this A* u use current n node heuristic value only, but in AO* u addup previous heuristic value 2,im little much confused plzz help
Yaha aapane jo huristic value li he vo random number he ya usako bhi find karane ki functionality hai??
Thank u for your videos it help me lot and I get well score from all the helpful videos.
Explanation techniques is awesome 👌
10:37 Please don't abuse anyone ;-P
Lol
very helpful, plz also add learning rules
If we calculate S -> A = 7 and S -> B = 6
The algorithm will search forward from B right, it won't go back to A because it got best between A and B as B.
please help
we can go to node A because in A* algorithm backtracking is possible.
thank you so much sir
Great explanation
its help me alot ..thank u
I am from Pakistan and Your videos are very helpfull for me as well as my group.. (Thanks again).. :)
khi say ho bhai india is best
Pakistan me bhi Engineer hote hai
Thank u 🙏.. So much sir
Can u pls tell me how to find that heuristic function value.how u got s:7
earlier you neglect S to B because you use it before but after that you again again use S to A. please clear this concept.
thankyou so much.. your lecture really helped me.
Plz explain full algorithm written in book
watch at 1.5x speed
Can you make a video on crypt arithmetic problem
really awesome video sir....thank you so much
Thank you so much.... Very brilliant videos...
I love Pakistani girl
Application of soft computing ka nhi banaye h video....
Thankyou sir ji,i like your lecture
Thanks for A* algorithm. Please Make video on IDA* algorithm...
Awsom video...
Easy to understand ...
Bxt lecture ...
Thnkx..
From pak
Sir bohot accha sikhaya hai aapne thank you
Perfect lecture...our college professor must have to learn from you..
Can you plz solve the 8 puzzle problem using A* algorithm
Sir, Thanks alot your videos are really helpful and it did save me during my exams, just one request can you make videos on mongodb
sir script theory k bary ma bta dyn..
good explaination
These algorithm .A* easily explain... Sir
thank u so much
These are the best explanation i ever got for Algos.
I really Appreciate the way you have explained the Algo. Also i have seen multiple videos on various other Algos.
Great work guys.
at 9:56 you miscalculated 8. the answer is 9. also Sir(anyone seeing the comment too), I wanted to ask what is the final answer??
it will not be 9 it will be 8 only
How will we know heuristic values ??
Thank you soo much sir for explaining soo well... Your videos are soo helpful... Thnx..😊😊
Sir can you plzzz make a video on A*(IDA*) Algorithm
thnk uu so muchh .it will really helpful i clearly understand this tooic . i hop god will bless u ..
Nice explanation
Thank you. No mistakes!
clear explanation. thank you so much
Heuristic value kuch bhi le sakte hai kya . Ya koi special process hai
Heuristic value goal tak jaane ka "rough estimate" value hai. It might or might not work but gives the ability to judge.
Ranganathan Ramanujam Thank you
PANDYA BROTHER`S VLOG India my pleasure.
At 8:58, is it 5 or maybe 3? btw your teaching style is awesome.
ya it is 5 :)
Thank you so much sir 😁
this was really helpful :) greeting from nepal
AI ko exam parsi :D :D
haha :D
😂😂😂 ai is comung 😭
Nepali Shabji 😂😂😂
oo shabji
You should be doing videos in english as well, but thanks for this one even though I dont understand the language
What is open and closed in A* algorithm
Thank you so much! You saved me.
Welcome dear
how to calculate heuristic value..?
How to solve 8 puzzle problem usnig A* algorithm?(Not given value of g(n) and h(n) ).
Plzz make videos on CSS and DSP also.
g(n) is explained incorrectly here. g(n) is the total cost from the start location to the node n.
Nikhil Gupta yhi to btaya h
In A * algo we don't have to traverse all the paths but u traverse all so this is djikstra not A*
Comprehensive video but A* is read as "A Star"
What is the time complexity of this algorithm?
Thnku bhai
2:11 It is a Graph, not a Tree. (Since it has loops)
Its tree
In graph theory, a tree is an undirected graph in which any two vertices are connected by exactly one path, or equivalently a connected acyclic undirected graph.
en.m.wikipedia.org/wiki/Tree_(graph_theory)
sir heuristic value kese find out huih isme .pls tell me
Is that the tabu search ?
Hey please make videos on iterative deepning and small memory A* algo.
Very Nice ..
Thanks brother
well teached n really helpful ...thank u😊
your lectures are amazing, Respect From Pakistan! (Y)