.. _sphx_glr_api_gallery_graph_theory_search:

Heuristic search
----------------

A* search: shortest paths guided by an estimate of the remaining
distance.


.. raw:: html

  <div id='sg-tag-list' class='sphx-glr-tag-list'></div>


.. raw:: html

    <div class="sphx-glr-thumbnails">

.. thumbnail-parent-div-open

.. raw:: html

    <div class="sphx-glr-thumbcontainer" tooltip="Finds a shortest path across a grid with a wall. With the Manhattan distance as its heuristic, A* reaches the same distance as Dijkstra&#x27;s algorithm while expanding far fewer vertices.">

.. only:: html

  .. image:: /api/gallery/graph_theory/search/images/thumb/sphx_glr_plot_01_astar_search_thumb.png
    :alt:

  :doc:`/api/gallery/graph_theory/search/plot_01_astar_search`

.. raw:: html

      <div class="sphx-glr-thumbnail-title">A* search on a grid with obstacles</div>
    </div>


.. thumbnail-parent-div-close

.. raw:: html

    </div>


.. toctree::
   :hidden:

   /api/gallery/graph_theory/search/plot_01_astar_search