thank you so much, for this lec, I really understand all ur lec on AI ,CA,DS and CD. it is very useful

Thank you very much. your videos helped me a lot specially in my AI and Compiler course🙏🙏

Nicely explained! Thanks alot.

By far the best lecture I have ever seen..

How to calculate the heuristic value.

how did you write heuristic values what happens if h=0 for node i and h= 9 for node G

Mam you explained this very well, thank you.

mam how to remember the h(n) values

Very good lecturing

what if with same tree; Node A value is 4 and Node B heuristic value is 12 how to you reach to the goal?

Mam what if A has less hurestic value than B ? How to go to goal node then ?

@kritchaudhary4436

4 ай бұрын

Using backshots I mean backtracking

@deva_2022

4 ай бұрын

@@kritchaudhary4436 I completed my graduation 2yrs back

sister how to take that h(n) values

So what is the total cost of the path taken

Very much uselful thanks a lot 🙏

Is it same as like A* Algorithm ?

Is there any way take h(n)

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

sorry U taught that the starting and ending/goal node are always zero. can you please elaborate?

How to take heuristic values mam

please tell me the fsearch strategies problem siolving methods in artificial intelligence

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.

Is best first seach the same as breadth first search

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

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

Жыл бұрын

What should be the criteria for taking heuristic values by own? What factors should we consider?

How to take node values

How to get our h(n) values

what if two nodes have same heuristic value

very nice explanation mam

Mam please explain bfs program using python language mam...?

mam how you have taken h(x) values

@moseskorrapati

2 ай бұрын

Is there any legend to answers this ?

Is it also called Greedy Best first search??

What happen if we not find solution

well explain

Thanks alot dear

Thankyou mam

You have a very sweet voice ma'am 💓

Really superb explaination mam,wonderfully mam ,do more videos mam,u made our life easy...tq u

How do u find heurastic value??

@sahildande515

Жыл бұрын

Already given in problem

if A had h(4) and B had h(12) then ?

Mam if G is having high value and i is having low value Then what will we do now

@abishekp1423

Ай бұрын

Then you can't solve this problem 😅😂

how to conclude heuristic VALUE?

@sravanr2275

Жыл бұрын

Same doubt

How to find the H(n) value ?

@kavya-fe9un

Жыл бұрын

Imaginary values

bravoo

thank youu

thanks

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.

h (n) values ela tisukunnaru mam

@tarunroyvardhan2499

3 жыл бұрын

Same doubt..

@pujithagaddale7171

2 жыл бұрын

Exam loo valistaru lekpothe mere nerchukoni povali rayadniki

In last video you told that best first search is optimal now you have said that it is not optimal

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

💯💯💯💯

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.

🙏👍

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).

❤

Thankyou madam

How to find the heuristic values???

@pujithagaddale7171

2 жыл бұрын

They will. Give in question else u have to learn those values

@electrotech7

2 жыл бұрын

@@pujithagaddale7171 Thanks

Wrong! It is indeed complete because search info is maintained in the open list.

She explained quite confusing

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??

Always goal state heuristic value is 0 🙃

copy from java point learing site

funny

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.

@Er.25

12 күн бұрын

Does she explain the concept of GBFS concept?

@Er.25

12 күн бұрын

@URMILASINGHBCE I don't know the difference between GBFS And BFS.So only I came here to watch videos.Can you explain the difference between them?

why are you always obsessed with S at root node 😂

@TechyRakshakold

22 күн бұрын

And G as Goal Node Always 🙃

Nhi samja

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.

Good explanation however work on your accent.

Please dont use colour pens 🥲🥲

@kritchaudhary4436

4 ай бұрын

What is your problem 🖕

@karthikgururajan1131

3 ай бұрын

Equality to all colors, don't be racist

@Abinaya956

17 күн бұрын

😂

Teach concepts not facts

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

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 😂

@VikashChiksil

3 жыл бұрын

😂😂