>
<li><p>might want to explore best moves = <em>killer moves</em> first</p></li>
</ul>
</li>
<li><p><em>transposition table</em> can hash different movesets that are just transpositions of each other</p></li>
</ul>
</li>
<li><p>imperfect real-time decisions</p>
<ul>
<li><p>can evaluate nodes with a heuristic and cutoff before reaching goal</p></li>
<li><p>heuristic uses features</p></li>
<li><p>want <em>quiescent search</em> - consider if something dramatic will happen in the next ply</p>
<ul>
<li><p><em>ho