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

preview_player
Показать описание
2. A* star Search Algorithm to move from initial state to Finale state start node to final node by Dr. Mahesh Huddar

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
********************************

4. Like, Share, Subscribe, and Don't forget to press the bell ICON for regular updates
Рекомендации по теме
Комментарии
Автор

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.

SIRIVURIVENKATASIVAVARMA
Автор

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

kruthu
Автор

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?

ankitkw