e highest value for the player choosing at n</p></li>
<li><p>time complexity - <span class="math notranslate nohighlight">\(O(b^m)\)</span></p></li>
<li><p>space complexity - <span class="math notranslate nohighlight">\(O(bm)\)</span> or even <span class="math notranslate nohighlight">\(O(m)\)</span></p></li>
</ul>
</li>
<li><p><em>alpha-beta</em> pruning cuts in half the exponential depth</p>
<ul>
<li><p>once we have found out enough about n, we can prune it</p></li>
<li><p>depends on move-ordering</p>
<ul