Alpha Beta pruning with transposition tables and negamax is tricky to implement right. Sign convention, switching alpha and beta. The transposition table needs to keep track of what kind of bound it is.
But this is an "obvious" algorithm; it basically works by not being stupid. Its difficulty suggests something wrong with a programming language.
I have seen a functional programming implementation of alpha beta (no TT), but don't remember it.
No comments :
Post a Comment