2. A* star Search Algorithm to move from initial state to Final state start node to final node

Поділитися
Вставка
  • Опубліковано 27 сер 2024
  • 2. A* star Search Algorithm to move from initial state to Finale state start node to final node by Dr. Mahesh Huddar
    1. Solved Example: • 1. A star Search Algor...
    2. Solved Example: • 2. A* star Search Algo...
    3. Solved Example: • 3. A star Search Algor...
    The following concepts are discussed:
    ______________________________
    a* algorithm,
    a star algorithm in artificial intelligence,
    a star algorithm explained,
    a* in artificial intelligence,
    an* algorithm 8 puzzle problem,
    a* algorithm in artificial intelligence,
    a* search algoritması,
    a* search algorithm,
    a star search,
    a star search algorithm,
    a star search algorithm example,
    a star search algorithm python,
    a star search example,
    a star search in python,
    a star search method,
    a star search calculator,
    a star search pseudocode
    ********************************
    1. Blog / Website: www.vtupulse.com/
    2. Like Facebook Page: / vtupulse
    3. Follow us on Instagram: / vtupulse
    4. Like, Share, Subscribe, and Don't forget to press the bell ICON for regular updates

КОМЕНТАРІ • 16

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

    wow i found a great channel for few topics to be covered in ai like resolution if you explain its better,because your explanation is so easy sir.

  • @kruthu345
    @kruthu345 7 місяців тому +3

    Thank you sir ❤ ... It helped me a lott😊

    • @MaheshHuddar
      @MaheshHuddar  7 місяців тому +1

      Welcome
      Do like share and subscribe

  • @G_Abhi
    @G_Abhi 6 місяців тому +1

    Great explanation sir 💐

    • @MaheshHuddar
      @MaheshHuddar  6 місяців тому +1

      Thank You
      Do like share and subscribe

  • @sianbunny7724
    @sianbunny7724 4 місяці тому +1

    Thank you sir

    • @MaheshHuddar
      @MaheshHuddar  4 місяці тому +1

      Welcome
      Do like share and subscribe

  • @bardankarki-ib2wr
    @bardankarki-ib2wr 2 місяці тому

    Thanks so much

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

      You're welcome!
      Do like share and subscribe

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

    Great work

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

      Thank You
      Do like share and subscribe

  • @ankitkw
    @ankitkw Рік тому +7

    Thanks for this. But it's not clear if transition cost from I to J isn't smallest. Then we should reach that (smallest value) node right?

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

      5:47 By Comparing f(E),f(H),f(J)...f(J) has least value which is 10 compared to others

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

      ​@@shashareddy5341Yeah, I don't remember why I had this doubt. But thank you.

  • @user-zm4kz8ek3q
    @user-zm4kz8ek3q Рік тому +1

    great explanation

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

      Thank You
      Do like share and subscribe