擅长:python、mysql、java
<p>“最小化”与“最大化”非常相似,因此只执行一个部分:</p>
<pre><code> function alphabeta(node, α, β, maximizingPlayer)
if node is a terminal node
return { value: value of node, node : node}
if maximizingPlayer
v = -∞
bestNode = None
for each child of node
localMax = alphabeta(child, α, β, FALSE)
if localMax.value > v
v = localMax.value
bestNode = localMax.node
α = max(α, v)
if β ≤ α
break
return {value : v, node: bestNode}
</code></pre>