[plt-scheme] Alpha-beta pruning

Sure, we'd be happy to help.  Where are your data definitions,
examples of data, and test cases?

Shriram

On Sat, Nov 14, 2009 at 12:00 PM, G G <shaoron at gmail.com> wrote:
> 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,
> G
>
> _________________________________________________
>  For list-related administrative tasks:
>  http://list.cs.brown.edu/mailman/listinfo/plt-scheme
>
>