Author: Robert Hyatt
Date: 07:37:35 09/07/99
Go up one level in this thread
On September 07, 1999 at 06:40:02, leonid wrote: >Brute force search is the base of good chess game. True or not true? This is >question to which I was not capable to response since I was able to try only >few games on this base. If somebody could help in finding the response it >be very nice. I tryed the Genius 4 and Rebel 10 so far (beside my engin) >and Rebel was all the time shining in "brute force" search. But do >Hiarcs perform even better in brute force numbers while having slightly >better game? Or, like somebody mentioned me, all this slight difference is >not in brute force (here they are all basically the same) but in database and >openings? > >Thanks for responding! >Leonid, All programs I know of are using a 'brute-force' approach to searching. Some do a lot of work in the evaluation, and their nodes per second is slower than others. Others do little work in the eval (nimzo/fritz) and their nodes per second is higher than others. But the searches are similar for everyone until you start talking about extensions for this and that.
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.