Computer Chess Club Archives


Search

Terms

Messages

Subject: ProbCut: An Effective Selective Extension of the Alpha-Beta Algorithm

Author: Albert Silver

Date: 07:20:30 07/21/04


Hi,

This is probably old news to many, but I ran across the pages of Michael Buro
(http://www.cs.ualberta.ca/~mburo/), and saw an article on ProbCut, highly
recommending it, and even mentioning its inclusion in a version of Crafty 18.15.

"ProbCut works in chess on top of null-move search! Download
mpc_crafty_18.15.tgz to play with it. We encourage all chess programmers to
experiment with ProbCut!"

One can download the article "ProbCut: An Effective Selective Extension of the
Alpha-Beta Algorithm" on his page of publications
(http://www.cs.ualberta.ca/~mburo/publications.html) as well as a follow-up
article "A.X. Jiang and M. Buro, First Experimental Results of ProbCut Applied
to Chess", Proceedings of the Advances in Computer Games Conference 10, Graz
2003.

For new programmers looking for material, this is certainly one, plus it might
be added to the links in the Computer Chess Resource Center.

                                    Albert



This page took 0.01 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.