Author: Fabien Letouzey
Date: 03:52:17 03/15/04
Go up one level in this thread
>I have been playing a few games with Fruit recently, the thing that I found most >surprising about it was the amazing time to depth of its search algorithm. My >progrma is not especially slow but it was lagging usually 1 or 2 ply in the >opening and 3 or so ply in the middlegame. >I am sure Fabien said it was a slow searcher in one of his posts !! I wish I >could make my program as slow a searcher as Fruit :-) > >As I think I recall Fabien saying there were no especially new features in Fruit >I am very intruiged as to how Fruit manages to get so deep so quickly? > >Is it due to exellent move ordering, aggressive pruning, or something else ? I use R=3 null move, and only have check extensions. So it might look like it searches "deep", but it also misses a lot of tactics. I just think that this does not matter so much at "slow" (whatever this means) time controls. You know that displayed search does not mean anything ... Fabien.
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.