<?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="Backtracking - Page 4 - Wikipedia">
<p>
<a accesskey="1" href="page.php?w=backtracking&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=backtracking&amp;p=5">3.Next</a>
</p>
<p>such as <a href="page.php?w=crosswords">crosswords</a>, <a href="page.php?w=verbal_arithmetic">verbal arithmetic</a>, <a href="page.php?w=Algorithmics_of_sudoku">Sudoku</a>, and many other puzzles.  It is often the most convenient technique for <a href="page.php?w=parsing">parsing</a>, for the <a href="page.php?w=knapsack_problem">knapsack problem</a> and other <a href="page.php?w=combinatorial_optimization">combinatorial optimization</a> problems.  It is also the program execution strategy used in the programming languages <a href="page.php?w=Icon_programming_language">Icon</a>,</p><p>
<a accesskey="1" href="page.php?w=backtracking&amp;p=3">1.Previous</a><br />
<a accesskey="3" href="page.php?w=backtracking&amp;p=5">3.Next</a>
</p>

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

</card>
</wml>
