ation problem</p></li>
</ul>
</section>
<section id="game-trees-r-n-5-2-5-5">
<h2><span class="section-number">1.10.2. </span>game trees - R&amp;N 5.2-5.5<a class="headerlink" href="#game-trees-r-n-5-2-5-5" title="Link to this heading">#</a></h2>
<ul class="simple">
<li><p>like search (adversarial search)</p></li>
<li><p><em>minimax algorithm</em></p>
<ul>
<li><p><em>ply</em> - half a move in a tree</p></li>
<li><p>for multiplayer, the backed-up value of a node n is the vector of the successor state with th