Informed Search: Admissible Heuristics and Domain Relaxation Part-6

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

КОМЕНТАРІ • 9

  • @srisaisubramanyamdavanam9912
    @srisaisubramanyamdavanam9912 Рік тому +5

    video lectures along with peter norvig AI book will be very good to use. thank u NPTEL for amazing lectures

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

    excellent class for beginner

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

    Amazing

  • @vetrimaaran1513
    @vetrimaaran1513 Рік тому +1

    So far so good. Hamiltonian cycle problem heuristic could have been diagramatically explained.

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

    One of the finest lectures ❤ IIT KGP

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

    Nice 👏

  • @samuel199915
    @samuel199915 3 роки тому +4

    gold

  • @akashadak4160
    @akashadak4160 2 місяці тому

    how the students are able to think so precisely?
    C'mon, you can't be that intelligent to predict every time, what the teacher is going to say

    • @denydungrani7364
      @denydungrani7364 2 місяці тому

      This is an IIT-D class. Not your local 3rd grade college 😅