A * algorithm is a searching algorithm that searches for the shortest path between the initial and the final state. f(n) =g(n) + h(n) g(n) = Actual cost from Start node to n node h(n) = Estimation Cost from n to Goal node.

A * algorithm is a searching algorithm that searches for the shortest path between the initial and the final state. f(n) =g(n) + h(n) g(n) = Actual cost from Start node to n node h(n) = Estimation Cost from n to Goal node.

36 slides abihanaqvi8

Verify you're human

Please complete the verification to continue

Back to Slideshow
Download Information
  • This is the original presentation file uploaded by the author
  • File format may vary (PPT, PPTX, PDF, etc.)
  • Please respect the author's copyright and usage terms
  • Author: abihanaqvi8