Computer Chess Club Archives

Search

Messages

Subject: Re: Help, please: best description of a modern chess program

Author: Artem Pyatakov

Date: 21:37:22 04/01/04

Go up one level in this thread

Dann,

That was a very nice reply - I will incorporate the feedback.

>If you keep a table of the counts of attack by piece type for each square, you
>don't have to bother with quiescence.  The question in that case is whether it
>is better to do the work of updating the tables or to do the work of >quiescence.

Is this really true? Can you explain how? Because I do have attack tables in my
program and I don't understand how this can help me avoid qsearch. Thanks!

Artem

• Re: Help, please: best description of a modern chess program Dann Corbit 21:41:48 04/01/04
  • Re: Help, please: best description of a modern chess program Tord Romstad 23:11:48 04/01/04
    • Re: Help, please: best description of a modern chess program Vasik Rajlich 01:34:45 04/02/04
      • Re: Help, please: best description of a modern chess program Anthony Cozzie 08:53:17 04/02/04
        • Re: Help, please: best description of a modern chess program Vasik Rajlich 03:14:03 04/03/04
      • Re: Help, please: best description of a modern chess program Tord Romstad 02:40:53 04/02/04
        • Re: Help, please: best description of a modern chess program Vasik Rajlich 03:24:17 04/03/04
    • Re: Help, please: best description of a modern chess program Dann Corbit 23:22:15 04/01/04
  • Skipping qsearch altogether (Vincent side question). Anyone try this? Artem Pyatakov 21:55:37 04/01/04
    • Re: Skipping qsearch altogether (Vincent side question). Anyone try this? Dann Corbit 22:08:56 04/01/04

This page took 0.01 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.