thank you so much, for this lec, I really understand all ur lec on AI ,CA,DS and CD. it is very useful
@Ruthviq
3 ай бұрын
By far the best lecture I have ever seen..
@R99zkcm
Жыл бұрын
Thank you very much. your videos helped me a lot specially in my AI and Compiler course🙏🙏
@deepakjangid3872
2 жыл бұрын
Nicely explained! Thanks alot.
@dashengovender766
3 жыл бұрын
Mam you explained this very well, thank you.
@regithamr1782
Жыл бұрын
Very good lecturing
@3dgiftz
2 жыл бұрын
Very much uselful thanks a lot 🙏
@tednones219
Жыл бұрын
How to calculate the heuristic value.
@yamijalavenkatsairamkamal4756
Жыл бұрын
very nice explanation mam
@haseebali47
4 жыл бұрын
what if C had less heuristic value then F for example c = 2 and f = 3
@aquarius_gaurav
2 жыл бұрын
Then, Also If we couldn't find the goal node from the least H(n) Path, We'll Backtrack and choose different Path from {Open}, Till we reach Goal (G).
@divyasri6469
8 ай бұрын
But in greedy it won't accept backtrack kadha mam
@deva_2022
2 жыл бұрын
Mam what if A has less hurestic value than B ? How to go to goal node then ?
@kritchaudhary4436
3 ай бұрын
Using backshots I mean backtracking
@deva_2022
3 ай бұрын
@@kritchaudhary4436 I completed my graduation 2yrs back
@srikanthchavala5430
Жыл бұрын
How do we consider heuristic values?
@itsmesana1288
Жыл бұрын
Take it as own or else they will mention in question
@generationaltalent7767
Жыл бұрын
What if they don't give any values but instead give only the edge values, do we take those values as heuristic values?
@itsmesana1288
Жыл бұрын
@@generationaltalent7767 no ,edges values consider as weights or path cost If the give values upon the nodes then we can consider as heuristic values. If then won't give heuristic values then we have to take by our own
@generationaltalent7767
Жыл бұрын
@@itsmesana1288 Alright thanks a lot
@uroojrajpoot7632
11 ай бұрын
What should be the criteria for taking heuristic values by own? What factors should we consider?
@lakshyachaturvedi2712
Жыл бұрын
You have a very sweet voice ma'am 💓
@danverd308
3 жыл бұрын
Hi, this video is very helpful and now I can understand it. But, can you explain on how to know when given state is finite ? I am still confused on this part...
@victoronofiok4551
2 жыл бұрын
I guess it is finite when you're to consider a given set of nodes No matter how small the set is, this search will not carry out evaluation on every node because of the heuristic technique it uses That's why it is incomplete
@codewithharry11
2 жыл бұрын
Thanks alot dear
@AJ-vq9ym
3 жыл бұрын
well explain
@kuswanthsiva
2 жыл бұрын
mam how to remember the h(n) values
@Janush___
25 күн бұрын
Thankyou mam
@moraswiphineas6003
2 жыл бұрын
Is best first seach the same as breadth first search
@NpnewsbNepal
11 ай бұрын
what if with same tree; Node A value is 4 and Node B heuristic value is 12 how to you reach to the goal?
@kavink3495
Ай бұрын
how did you write heuristic values what happens if h=0 for node i and h= 9 for node G
@kaviyasekar2578
Жыл бұрын
So what is the total cost of the path taken
@lakshmikaviti9595
2 жыл бұрын
sister how to take that h(n) values
@lakshmanvinay4648
4 жыл бұрын
what would be the answer if the heuristic value of I=0 and G=9 and Is it compulsory that goal state must have least value
@rickroll4578
4 жыл бұрын
I guess then we have to backtrack...not sure though
@olenshofiti3208
4 жыл бұрын
The greedy best-first algorithm is incomplete which means that it might NOT find the solution. It does not backtrack. If G was 9 and I was 0 the algorithm would go in an infinite loop. It would go back and forth to F and I.
@meghasharma4267
3 жыл бұрын
Goal ki heuristic value is always 0. Because heuristic value denotes cost to reach goal state.
@victoronofiok4551
2 жыл бұрын
I guess It would still be the same Because the open priority queue sorts the nodes in ascending order So the open queue on visiting the successors of node f will be [I 0, G 9] (in you case where I=0, G=9) Final path will be S, B, F, I Considering the Least value, because she is trying to find the shortest path to the goal node and the heuristic value of each node states the distance from a node to the goal node. This is what i think it is
@aquarius_gaurav
2 жыл бұрын
@@rickroll4578 You are right. That is the reason we have {Open} in the first place.
@sushmashankar5179
3 жыл бұрын
Really superb explaination mam,wonderfully mam ,do more videos mam,u made our life easy...tq u
@mahendrareddy1905
Жыл бұрын
How to take heuristic values mam
@PrakashGR7
2 жыл бұрын
Is it same as like A* Algorithm ?
@CreativeLife852
Жыл бұрын
Mam please explain bfs program using python language mam...?
@abdulbasidyau2077
Жыл бұрын
sorry U taught that the starting and ending/goal node are always zero. can you please elaborate?
@psnaveen8941
Жыл бұрын
Is there any way take h(n)
@konkipavankonkipavan5286
Жыл бұрын
How to take node values
@birukgetachew9084
2 ай бұрын
thanks
@BhumireddySunilKumarReddy
Жыл бұрын
please tell me the fsearch strategies problem siolving methods in artificial intelligence
@hibakhan9764
11 ай бұрын
thank youu
@varunreddy3282
Жыл бұрын
what if two nodes have same heuristic value
@gauriverma4331
4 жыл бұрын
Why A is going in Open, B should go cause it has less heuristic value. A should go in close as it's discarded
@ai_anisha3118
4 жыл бұрын
it is not about A going in open or B is, as we are tracking the path using the heuristic value. obvi the lesser value will be locked /closed. that here the comparing is done. after the node S the open nodes are A or B that A remains open as its heuristic value is greater.
@khaledalsayed2557
2 жыл бұрын
bravoo
@jayasuriyaj3010
5 ай бұрын
Is it also called Greedy Best first search??
@simple17226
2 жыл бұрын
how to conclude heuristic VALUE?
@sravanr2275
Жыл бұрын
Same doubt
@tanushreemondal4539
Жыл бұрын
How do u find heurastic value??
@sahildande515
Жыл бұрын
Already given in problem
@thekidscartoons1163
Жыл бұрын
mam how you have taken h(x) values
@moseskorrapati
Ай бұрын
Is there any legend to answers this ?
@moseskorrapati
Ай бұрын
How to get our h(n) values
@dinesh.m7341
2 жыл бұрын
if A had h(4) and B had h(12) then ?
@saivijay9483
7 ай бұрын
Mam if G is having high value and i is having low value Then what will we do now
@abishekp1423
21 күн бұрын
Then you can't solve this problem 😅😂
@iamurfacts
7 ай бұрын
What happen if we not find solution
@devkrishnamk3905
Жыл бұрын
💯💯💯💯
@HafsaBibi-be5tv
Ай бұрын
❤
@kaviyaa9610
Жыл бұрын
How to find the H(n) value ?
@kavya-fe9un
Жыл бұрын
Imaginary values
@devalorbengbamadozin3210
Ай бұрын
🙏👍
@ansh3737
3 жыл бұрын
How did u decide the heuristic value for each of the node? Like y u took h (n) for node S =13 only? Y not 5 or any random value?
@Dubspez
3 жыл бұрын
Think of h() as a function and n is your input. h() could be any function you can think of with certain rules or conditions. When you input n in h() or h(n) you generate a heuristic value. n would probably be a value directly related to the node you're computing the heuristic value for. You use said heuristic value to make comparisons for best-first search. Does that explain it?
@victoronofiok4551
2 жыл бұрын
@@Dubspez thanks
@rahulpagidimarri7332
3 жыл бұрын
Thankyou madam
@suryadeeptamazumdar8800
Жыл бұрын
In last video you told that best first search is optimal now you have said that it is not optimal
@a2zfunbegins273
3 жыл бұрын
What if the value of E is lesser than F
@hadjer168
2 жыл бұрын
The greedy best-first algorithm is incomplete which means that it might NOT find the solution. What is the case if the value of E is lesser than F.
@surapusuma8922
3 жыл бұрын
h (n) values ela tisukunnaru mam
@tarunroyvardhan2499
3 жыл бұрын
Same doubt..
@pujithagaddale7171
2 жыл бұрын
Exam loo valistaru lekpothe mere nerchukoni povali rayadniki
@marouenkadri8771
3 жыл бұрын
if we have two nodes having the same H(n) who will be in the closet and who will be continued the process
@semivainitoba4696
2 жыл бұрын
Probably the reason why the search is incomplete, and may end up in a loop
@aquarius_gaurav
2 жыл бұрын
@@semivainitoba4696 No. In that case also If we couldn't find the goal node from the either one of H(n) Path, We'll Backtrack and choose different Path from {Open}, Till we reach Goal (G).
@ayushihota1167
2 жыл бұрын
She explained quite confusing
@user-sq9jb6ws2v
Жыл бұрын
Always goal state heuristic value is 0 🙃
@alifarooq296
3 жыл бұрын
Considering heuristically informed search (Best first search). You are required to find straight line distance. • Based on the cost we devise paths in the graph for traversing towards the goal node. • Priority Queue • Initial State • If the node is a goal Then return the path from initial to node else generate all successor of nodes and put the newly generated node into open according to their f values. Cost is given on the edge of each node path. will this question be solved the same as described above??
@electrotech7
3 жыл бұрын
How to find the heuristic values???
@pujithagaddale7171
2 жыл бұрын
They will. Give in question else u have to learn those values
@electrotech7
2 жыл бұрын
@@pujithagaddale7171 Thanks
@RRCSafrozalam
Жыл бұрын
copy from java point learing site
@Dbanj598
9 ай бұрын
Wrong! It is indeed complete because search info is maintained in the open list.
@namansingh7721
3 жыл бұрын
Teach concepts not facts
@URMILASINGHBCE
3 жыл бұрын
Mam, kindly get your concepts clear. IN BFS, we use f(n) and in GBFS we use h(n). You showed h(n) in BFS and used it and got me confused and wrong. Kindly correct it.
@subramanimuthu9834
4 жыл бұрын
Nhi samja
@m.s.panigrahi9515
7 ай бұрын
Please dont use colour pens 🥲🥲
@kritchaudhary4436
3 ай бұрын
What is your problem 🖕
@karthikgururajan1131
2 ай бұрын
Equality to all colors, don't be racist
@Abinaya956
Күн бұрын
😂
@renliz216
2 ай бұрын
funny
@user-anuhya
2 жыл бұрын
she keeps copying all this theory from javapoint and explain it. actually, what she explains doesn't seem like explanation but reading. coming to the explanation of problems or examples it's too confusing.
@soham4741
2 жыл бұрын
its not copying. She works for javapoint
@user-anuhya
2 жыл бұрын
@@soham4741 ohh , seems like i misunderstood. sorry.
@AliKhan-ri5fk
7 ай бұрын
Good explanation however work on your accent.
@smritipandey1631
Жыл бұрын
She is not elaborating all main characteristics of every topic… like how to evaluate heuristic value here smartly leaving those things Also her pronunciation is very poor
@Stussycola
7 ай бұрын
why are you always obsessed with S at root node 😂
@TechyRakshakold
7 күн бұрын
And G as Goal Node Always 🙃
@ev.c6
3 жыл бұрын
BRO, everything regarding computers has some indian video. Hahaha
@srujanpogathota1419
3 жыл бұрын
Come and teach and I will be the first person commenting bro everything regarding computers has Indian videos haha 😂
Пікірлер: 114