Great info, we have one private video added to this AI playlist where we are unable to see it. Could you please mark that as public video if you think that by mistakenly marked as private which is Lec-16, thanks in advance
the video doesnt take into consideration on what to do once the intersection is found but is not the most optimal one though. its assuming that the first intersection it sees is optimal
Hii are you an AI student can u please share your experience as a AI student. Can u pls tell me cybersecurity or AI is better accoding to your experience? plss reply when u get time.
Potentially not.. If we know both the starting node and the goal node, then shouldn't the task be to determine whether or not a path exists between these two nodes?
@@intuitivemobility not really because to find the path efficiently, you need to search from both directions.. what you said " task be to determine whether or not a path exists between these two nodes ?" that can be done with any search because we know the goal and root node in advance, also with just single direction. this itself destroys the whole purpose of bidirectional search. so he's right backward search to find root node and forward search to find goal node
Great info, we have one private video added to this AI playlist where we are unable to see it. Could you please mark that as public video if you think that by mistakenly marked as private which is Lec-16, thanks in advance
Mam, For every algo we need to know the goal state in prior, and hence we can search. Right, mam?
Great info, we have one private video added to this AI playlist where we are unable to see it. Could you please mark that as public video if you think that by mistakenly marked as private which is Lec-16, thanks in advance
the video doesnt take into consideration on what to do once the intersection is found but is not the most optimal one though. its assuming that the first intersection it sees is optimal
We can take any node as goal node or last node is always goal node?
i guess it will told in the question, the goal node will be any node but that which indicated by the qn
Pls upload lecture-16
At First Thanks madam For these video . Its is So useful .madam Some searchs are missing
Where is uniform cost search
Very nyc explanation mam tqqq so much 🥰
Hii
are you an AI student
can u please share your experience as a AI student. Can u pls tell me cybersecurity or AI is better accoding to your experience? plss reply when u get time.
I think there is a mistake. there should be" backward search to find 'root' node" instead of goal node
Potentially not.. If we know both the starting node and the goal node, then shouldn't the task be to determine whether or not a path exists between these two nodes?
@@intuitivemobility not really because to find the path efficiently, you need to search from both directions.. what you said " task be to determine whether or not a path exists between these two nodes ?" that can be done with any search because we know the goal and root node in advance, also with just single direction. this itself destroys the whole purpose of bidirectional search. so he's right backward search to find root node and forward search to find goal node
If goal node is already known, what are we even supposed to search ?
the path between the start and the goal
Please add videos on implementation
@Education 4u please maam show private video to public .... Video no 16
No clarity in example problem😌
Can you please make lecture 16 public???
sagapaw
7 missing
explain the graph properly
Ai ka paper hai na monday ko
@@jasonbrody4618 yes
Where is the path.. Copy 🐱
just wastege of time...ex to solve hi nhi krai😢
usy oper say ilham hoa h k 1 say 4 or 4 say direct 8 jana h ? pori information to do ajeeb jahil ustad h
Great info, we have one private video added to this AI playlist where we are unable to see it. Could you please mark that as public video if you think that by mistakenly marked as private which is Lec-16, thanks in advance