Author: jefkaan
Date: 10:01:05 11/24/02
Go up one level in this thread
On November 23, 2002 at 11:11:16, Christophe Theron wrote: >I think it's better to first assume that the kind of QSearch you do will not >interfere with the quality of the pruning algorithm used before the QSearch. guess you're right; reason i brought up such issues is to find out where most time is spent in a program; apparently it's in the attack tables, which means progress could be made in these algorithms with inline assembler code (maybe Fritz is doing that); personally i know will ever reach Tiger of Fritz' level but it's interesting to understand a bit more how these program work anyway; so thx for your reply.
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.