Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Why Fast Search is more important in Speed Chess.

Author: Terry Ripple

Date: 05:29:40 08/27/99

Go up one level in this thread


On August 27, 1999 at 07:16:54, Georg v. Zimmermann wrote:

>>I get confused on this fast searcher is better at speed chess issue.
>>
>
>There are far more 3ply "combinations" in a chess game than 5ply "combinations",
>and far more 5ply combinations than 7ply ...
>
>this means that a Slower searcher will miss more tactical things in a speed game
>than in a standart game (compared to a Faster searcher).
>
>The better eval. Function will not help much after it lost a pawn, it is more
>important in standart chess.

Hi Georg,
  Not necessarily! Example: Hiarcs7.32 is a knowledge program that has much
knowledge which slows it down as far as the amount of nodes per second it
searches. Fritz is supposed to think about 10 times more nodes per second than
Hiarcs but yet Hiarcs beats out Fritz in many of the tactical positions!
  Hiarcs having all this knowledge searches "Smarter" and thus enables it to
find the correct solutions sometimes even faster than the fast searchers can.
There is a claim that Hiarcs7.32 is by a far margin the strongest 1 min.Blitz-
player in the world!
  Another note: Hiarcs7.32 is beating Fritz5.32 by 11-5 so far in the SSDF tour-
naments! Need i say more!!!

Best regards,
Terry




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.