<?xml version="1.0" encoding='utf-8'?>
<!DOCTYPE wml PUBLIC "-//WAPFORUM//DTD WML 1.1//EN" "http://www.wapforum.org/DTD/wml_1.1.xml">
<wml>
<card id="card1" title="Heuristic (computer science) - Page 11 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=Heuristic_(computer_science)&amp;p=10">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Heuristic_%28computer_science%29&amp;p=12">3.Next</a>
</p>
<p>Heuristics are central to many informed search algorithms and optimization techniques for AI:</p>

<p>
* <b><a href="page.php?w=A%2A_search_algorithm">A* Search Algorithm</a></b> The A* search algorithm is one of the most popular heuristic search techniques due to its ability to find optimal solutions efficiently. A* combines both the <b>actual path cost</b> and the <b>heuristic estimate</b> of the remaining cost to reach the goal.</p>

<p>
* <b><a href="page.php?w=Greedy_best-first_search">Greedy Best-First Search</a>:</b> This algorithm expands</p><p>
<a accesskey="1" href="page.php?w=Heuristic_(computer_science)&amp;p=10">1.Previous</a><br />
<a accesskey="3" href="page.php?w=Heuristic_%28computer_science%29&amp;p=12">3.Next</a>
</p>

<do type="prev" label="Search">
        <go href="search.wml"/>
</do>

</card>
</wml>
