Informed Search: Best First Search Part-1

Поделиться
HTML-код
  • Опубликовано: 18 дек 2024

Комментарии • 7

  • @anuragpatil7319
    @anuragpatil7319 2 года назад +8

    One of the best courses in Artificial Intelligence for an undergrad!

    • @garbagebin3693
      @garbagebin3693 Год назад +2

      Among all the courses i have taken in NPTEL ! HE IS THE 🐐

  • @takshpatel8109
    @takshpatel8109 2 года назад

    👍👍👍👍👍

  • @wtfJonKnowNothing
    @wtfJonKnowNothing 11 месяцев назад +2

    He had to sort of tell them that's a joke and still nobody laugh. So, maybe it's not a good joke or IITians are creepy😂. ( cuz I'm also from the one and hate y'all

  • @ximin_sleepy
    @ximin_sleepy Год назад +1

    A small doubt, at @11:34 if the state is not a goal state we insert the node in the explored, and update the fringe saying add all the succs of node into it if node is not in explored, this makes no sense to me because we just added node to the explored list! Help me understand If I'm missing a point. Thanks for the amazing series.

    • @yrrannapanna
      @yrrannapanna 6 месяцев назад

      how does it not make sense?the fringe/frontier will keep changing after every evaluation na

  • @kumar_gautam24
    @kumar_gautam24 Год назад

    isn't it similar to Dijkstra's algo