Author: Russell Reagan
Date: 19:13:03 07/21/04
Go up one level in this thread
On July 21, 2004 at 10:20:30, Albert Silver wrote: >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 I guess there are varying degrees of getting something to "work". I didn't find any situation where the prob-cut version played noticably better than normal Crafty. I tried his version quite some time ago, and I remember that it did poorly in matches against other engines. Missed tactics were the usual problem. At faster time controls it wasn't pretty at all. I think longer time controls were better, but not really any improvement over "normal" Crafty. Overall it seemed less reliable tactically than normal Crafty, and that's not a good thing generally. However, it was quite a while back when I tested this and I am just working from memory. That was the impression I remember, but it may not be as bad as I remember it, and my experiments certainly weren't comprehensive by any means.
This page took 0 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.