Author: Gian-Carlo Pascutto
Date: 07:04:47 02/14/02
Go up one level in this thread
On February 14, 2002 at 04:23:26, Uri Blass wrote: >The programmer said that he used assembler to optimize part of the move >generator and I understood from posts of the programmer that the program is >complex. What makes you believe Shredder doesn't have those optimisations? I believe that if LG is complex, it'll be in the movegen/search and in speedups for the evaluation routines. I mentioned Shredder and LG because they pretty much seem to be on opposite ends on the speed vs. knowledge scale. However, if the discussion is complexity vs non-complexity, probably both programs will be quite complex. -- GCP
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.