Breadth-First Search Algorithm Solved Example Advantages and Disadvantages by Dr. Mahesh Huddar

Поділитися
Вставка
  • Опубліковано 6 січ 2025

КОМЕНТАРІ • 12

  • @dheerajswaroopsm691
    @dheerajswaroopsm691 2 роки тому +9

    On point nice explanation 👍🏻

    • @MaheshHuddar
      @MaheshHuddar  2 роки тому +4

      Thank You
      Do like share and subscribe

  • @amritalimbu8584
    @amritalimbu8584 Місяць тому

    thank you sir for such clear understanding

  • @dml11reshmakondrupati7
    @dml11reshmakondrupati7 Рік тому +2

    Ur explanation is awesome and voice tooo

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

    I m handling artifical intelligence i m watching ur video plz share more video realted to that
    I m lecture

  • @HalimaBegum-jp3gv
    @HalimaBegum-jp3gv 2 роки тому +8

    Hello Sir. First of all thank you so much, your videos are really helpful.
    And sir, i have a doubt regarding this bfs. I have read that "in bfs, goal test is applied to each node when the node is "generated" rather than when it is selected for expansion." But in ur example, when c is expanded and nodes D and G are generated, then why do we have to wait for G to expand for goal-testing.?

    • @tteemmzz
      @tteemmzz 9 місяців тому

      Yes, this was mentioned in the Artificial Intelligence: A Modern Approach, Global Edition textbook by Stuart Russell, and Peter Norvig

  • @angelmaanu3625
    @angelmaanu3625 11 місяців тому +5

    How to identify goal state sir

  • @pkumar0212
    @pkumar0212 5 місяців тому

    👌