Easy Engineering Classes
Full Course of Artificial Intelligence(AI) – https://youtube.com/playlist?list=PLV8vIYTIdSnYsdt0Dh9KkD9WFEi7nVgbe
In this video you can learn about A Star(A*) Search in Artificial Intelligence with Solved Examples. It is an example of Informed Search in Artificial Intelligence. The video explains A Star(A*) Search Algorithm with advantages and disadvantages. This topic is very important for College University Semester Exams and Other Competitive exams.
A* Search Algorithm in Artificial Intelligence with Solved Examples
Artificial Intelligence Video Lectures in Hindi
👉 Follow us on Social media:
Facebook: http://tiny.cc/ibdrsz
▶️ Links for Hindi playlists of all subjects are:
Data Structure: http://tiny.cc/lkppsz
#DBMS : http://tiny.cc/zkppsz
#Java: http://tiny.cc/1lppsz
Control System: http://tiny.cc/3qppsz
Computer Network Security: http://tiny.cc/6qppsz
Web Engineering: http://tiny.cc/7qppsz
Operating System: http://tiny.cc/dqppsz
EDC: http://tiny.cc/cqppsz
TOC: http://tiny.cc/qqppsz
Software Engineering: http://tiny.cc/5rppsz
DCN: http://tiny.cc/8rppsz
Data Warehouse and Data Mining: http://tiny.cc/yrppsz
Compiler Design: http://tiny.cc/1sppsz
Information Theory and Coding: http://tiny.cc/2sppsz
Computer Organization and Architecture(COA): http://tiny.cc/4sppsz
Discrete Mathematics (Graph Theory): http://tiny.cc/5sppsz
Discrete Mathematics Lectures: http://tiny.cc/gsppsz
C Programming: http://tiny.cc/esppsz
C++ Programming: http://tiny.cc/9sppsz
Algorithm Design and Analysis(ADA): http://tiny.cc/fsppsz
E-Commerce and M-Commerce(ECMC): http://tiny.cc/jsppsz
Adhoc Sensor Network(ASN): http://tiny.cc/nsppsz
Cloud Computing: http://tiny.cc/osppsz
STLD (Digital Electronics): http://tiny.cc/ysppsz
Artificial Intelligence: http://tiny.cc/usppsz
Links for #GATE/#UGCNET/ PGT/ TGT CS Previous Year Solved Questions:
UGC NET : http://tiny.cc/brppsz
DBMS GATE PYQ : http://tiny.cc/drppsz
TOC GATE PYQ: http://tiny.cc/frppsz
ADA GATE PYQ: http://tiny.cc/grppsz
OS GATE PYQ: http://tiny.cc/irppsz
DS GATE PYQ: http://tiny.cc/jrppsz
Network GATE PYQ: http://tiny.cc/mrppsz
CD GATE PYQ: http://tiny.cc/orppsz
Digital Logic GATE PYQ: http://tiny.cc/rrppsz
C/C++ GATE PYQ: http://tiny.cc/srppsz
COA GATE PYQ: http://tiny.cc/xrppsz
DBMS for GATE UGC NET : http://tiny.cc/0tppsz
Source
Sir pls PAS , IAS , PMM , BDA , SET ke videos upload kr do pls … Lockdown ke baad exams hae sir aapse parne ki aadat ho gye hae
Please make a video series on Advanced computer architecture
VERY PRECISE, CLEAR, TO THE POINT…. GOOD
Thank u
You make it clear
Thank you sir.
Awesome 💞
very well explained !
Nice video thanks you ❤️
💓💓💗💗💗
theoritical knowledge is help to college and univercity exam
I was looking for this, TYSM <3
Bhai hmara collage k teacher's bhi lgta ha apki videos ko follow krta ha apki wali examples padha rha ha
Would u please give me notes in PDF
Thank you sir 🌺
Great sir
Thank you sir for providing quality education.
I am Muslim and my religion Islam teaches us to invite others to this true religion of Almighty God.
I invite everyone to learn and understand the Islam.I invite you all to read the translation of the religious book of Islam "Al-Quran"
I think you dont need to explore further if a goal node path is less than all the previously left out paths
(In example 2, 6 is less than 10,7,11 so s -> a -> c -> g will be the final path)
Bht mushkil h😞😞
Yaar aap kahan thay aab tak.Maa 2nd semester maa hoo BsAI kay mujhay itni achi samajh pehlay kabhi nahi aai AI ky algorithms ki.
Nice
Best explanation I found till now
Wrong answer hai qki final answer SACD hoga
🎉😢😢😮❤😅❤
I want to know how did you get heuristics value here you may have taken randomly but in code how should we take in similar lroblem eucledian distance is not possible I guess
Algorithm explain nahi kiya bhai,baki sab kardiya
basically you are calculating all possible paths then what is the significance of heuristic value?
sir pen kahaa se kharidte ho?
sir in the further explanation why you haven't taken path cost along with heuristics?
Sir your lecture is owesum .and also help to clearly screenshot ❤❤🎉
4:41 Clock ticking sound x_x
S->B->C=6+(2+1)
wrong Answer
Good teaching sir
bakwaas samjhaya he bilkul
thanks sir
Sir you explained it beautifully, but I just want to know that how to find heuristic value because in exam how do we figure out the heuristic value because it would be difficult to cram the exact heuristic value.
sir way are you confuse us if we check the lowest f(n) value every time to take the next step then we find the smallest path according to this algorithm so why we check the other path which you check here like in second example we know that we find the smallest f(n) of path s to a to c to g then why you check other they give the high value from this
good update