[plt-scheme] Alpha-beta pruning

From: G G (shaoron at gmail.com)
Date: Sat Nov 14 12:00:29 EST 2009

I am trying to implement the alpha beta pruning but with no luck can anyone
help me with how it works I am trying to use this Algorithm

αβ(n, d, α, β)
S ← Successors(n)
if d ≤ 0 ∨ S ≡ ∅ then
return f(n)
best ← −∞
for all ni ∈ S do
  v ← −αβ(ni, d − 1, −β, −max(α, best))
   if    v > best    then
    best ← v if    best ≥ β    then
      return best
return best

Best regards,
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://lists.racket-lang.org/users/archive/attachments/20091114/18779182/attachment.html>

Posted on the users mailing list.