BFS algorithm | informed search | Artificial intelligence | Lec-18 | Bhanu Priya

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

КОМЕНТАРІ • 11

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

    oh my god,...
    miss, i have started this artificial intelligent module from this semester last week.. haaa you have posted them just 2 days ago...
    thank you so much..
    i usually refer your videos for most of my modules.
    and it would be helpful this time also

  • @tejas2933
    @tejas2933 2 роки тому +2

    mam your channel is the best for computer students, ecofriendly and optimistic

  • @onurcanisler
    @onurcanisler 2 роки тому +21

    *I sometimes feel like I would never graduate if it weren't for Indian tutors.*

  • @Parikarthik369
    @Parikarthik369 2 роки тому +1

    U r explanation is really so good mam
    Thanks a lot mam

  • @mansonchallenger1143
    @mansonchallenger1143 3 роки тому +3

    This video is great! Thank you very much!

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

    it is recursive best first search or best first search

  • @aleesharijas9801
    @aleesharijas9801 4 роки тому +6

    It’s is very helpful for my university exam

  • @Reem.alhamimi
    @Reem.alhamimi 25 днів тому

    Greedy search is One of the simplest strategies of BFS, its not BFS. Correct??

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

    Mam how to write algorithms in psudocode function

  • @Mass_Maha_Raja_Ravi_Teja-v1q
    @Mass_Maha_Raja_Ravi_Teja-v1q 3 місяці тому

    thanks a lot mam