Computer Chess Club Archives

Search

Messages

Subject: Re: Attack Tables

Author: Dan Andersson

Date: 08:06:35 06/26/01

Go up one level in this thread

In most cases I get all the information I need from one or a few indirect memory
lookups, that's not too slow IMO. In my case, the Attackboard is used in
conjunction with an efficient conventional representation. I do feel that it's
correct to incrementally update variables that are used to either improve move
ordering or create cutoffs. As for speed of implementation I cannot really
compare figures, since I reuse a lot of data i.e. the behaviour will be
asymptotic (and very fast) and not representative of its behaviour on a
completely new position. But on closely similar positions (for example a
sequence of positions in a line searched) it has a good performance.

Regards Dan Andersson

• Re: Attack Tables Vincent Diepeveen 09:00:26 06/26/01
  • Re: Attack Tables Robert Hyatt 21:02:09 06/26/01
    • Re: Attack Tables Vincent Diepeveen 10:38:45 06/27/01
      • Re: Attack Tables Robert Hyatt 05:50:05 06/28/01

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.