Abstract

An optimization of the alpha-beta search algorithm is proposed. When used in conjunction with a transposition table, the optimization can reduce the number of positions searched. Measured reductions in searching checkers lookahead trees range from 0% to 16%, with an average reduction of 7%.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call