Bidirectional search algorithm | uninformed | Artificial intelligence | Lec-17 | Bhanu Priya

Поділитися
Вставка
  • Опубліковано 24 лис 2024

КОМЕНТАРІ •

  • @kullayappamacha9194
    @kullayappamacha9194 4 роки тому +7

    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

  • @japanboy31415
    @japanboy31415 10 місяців тому

    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

  • @adeshpandey1114
    @adeshpandey1114 3 місяці тому

    The search stop when these two graph intersect each other or found the goal ,

  • @tundergamers6364
    @tundergamers6364 2 роки тому +22

    No clarity in example problem😌

  • @SharathsooryaBCS
    @SharathsooryaBCS 10 місяців тому +1

    Mam, For every algo we need to know the goal state in prior, and hence we can search. Right, mam?

    • @chathurawimalasiri5920
      @chathurawimalasiri5920 3 місяці тому +1

      In terms of AI, no, we do not always need to know the goal state in advance. Many AI search algorithms, such as uninformed search algorithms like Breadth-First Search (BFS) and Depth-First Search (DFS), or informed search algorithms like A* Search, operate without prior knowledge of the exact goal state. Instead, these algorithms explore the search space, guided by rules or heuristics, to find a goal state that satisfies certain conditions.

    • @SharathsooryaBCS
      @SharathsooryaBCS 3 місяці тому

      @@chathurawimalasiri5920 Oh ok thank you mam

  • @aswinbinu7563
    @aswinbinu7563 4 роки тому +4

    At First Thanks madam For these video . Its is So useful .madam Some searchs are missing

  • @tejasghodake8513
    @tejasghodake8513 2 роки тому +8

    Where is the path.. Copy 🐱

  • @TharunKumar-or9ip
    @TharunKumar-or9ip Рік тому

    If goal node is already known, what are we even supposed to search ?

    • @japanboy31415
      @japanboy31415 10 місяців тому +1

      the path between the start and the goal

  • @bandiganesh2294
    @bandiganesh2294 5 років тому +5

    Where is uniform cost search

  • @prabhashff3961
    @prabhashff3961 14 днів тому

    What is aim of this search strategy?

  • @Vikashkumar-js8hb
    @Vikashkumar-js8hb 5 років тому +1

    I think there is a mistake. there should be" backward search to find 'root' node" instead of goal node

    • @intuitiveperformance
      @intuitiveperformance 3 роки тому

      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?

    • @ghoritauheed7182
      @ghoritauheed7182 2 роки тому

      @@intuitiveperformance 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

  • @lakshyachaturvedi2712
    @lakshyachaturvedi2712 2 роки тому

    We can take any node as goal node or last node is always goal node?

    • @managerfufu
      @managerfufu 10 місяців тому

      i guess it will told in the question, the goal node will be any node but that which indicated by the qn

  • @durgabhavanijangam3617
    @durgabhavanijangam3617 2 роки тому

    Very nyc explanation mam tqqq so much 🥰

    • @anaghajyothi765
      @anaghajyothi765 9 місяців тому +1

      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.

    • @r.keerthivasan4415
      @r.keerthivasan4415 3 місяці тому

      ​@@anaghajyothi765go for cs

    • @Bhuvanesh-sl2zn
      @Bhuvanesh-sl2zn 2 місяці тому

      @@anaghajyothi765 AI

  • @daredevilrbl1254
    @daredevilrbl1254 3 роки тому

    Pls upload lecture-16

  • @saurabhmarpadge7498
    @saurabhmarpadge7498 4 роки тому

    Please add videos on implementation

  • @shubhamprateek8555
    @shubhamprateek8555 3 роки тому

    Can you please make lecture 16 public???

  • @modidhrumil3873
    @modidhrumil3873 3 роки тому +2

    explain the graph properly

  • @nightking6122
    @nightking6122 Рік тому

    7 missing

  • @lokeshsinha8201
    @lokeshsinha8201 3 роки тому

    @Education 4u please maam show private video to public .... Video no 16

  • @fizakhan1427
    @fizakhan1427 Рік тому

    just wastege of time...ex to solve hi nhi krai😢

  • @ΚωσταςΜερεος
    @ΚωσταςΜερεος 4 роки тому +1

    sagapaw

  • @KsAnriChan
    @KsAnriChan 3 місяці тому

    All I heard is screams

  • @abdulHameed01
    @abdulHameed01 2 роки тому

    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

  • @devaa7076
    @devaa7076 3 роки тому

    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