A* Algorithm | Solved Example | Informed Search | Artificial Intelligence

A* is an informed search algorithm.
It is the most widely known form of best-first search.
(Best First Search • Greedy Best First Sear... )
0:20 A * Algorithm
1:07 Solved Example

[@AhmedMohamed-iu9im]

👏👏👏👏👏

[@asheeshmathur]

Excellent Session, watched couple of them. Need some help I'm solving Tower Of Hanoi using A* also. in Python. The question is how tø model Disks, Rods and Movement and Heuristic function. Thanks a ton

[@beingpassionatelearner7344]

Thank you for your feedback. You can refer to this paper for heuristic functions for Tower of Hanoi. It will be helpful. www.ptolomeo.unam.mx:8080/xmlui/bitstream/handle/132.248.52.100/15146/Art%C3%ADculo.pdf?sequence=3/1000