Computer Chess Club Archives

Search

Messages

Subject: Re: incremental attack tables?

Author: Omid David Tabibi

Date: 00:26:36 05/05/04

Go up one level in this thread

On May 05, 2004 at 03:03:15, Daniel Shawul wrote:

>Hello
>
>Is incremental attack table slower than creating them on fly?
>I have both versions working properly right now but the incremental
>one further drops NPS by 30% , though InCheck and Checks are for free in this
>case. Anybody have similar experience? I am sure i have made no mistake in
>updating because i checked it with the known perft positions and node count is
>perfect.

It depends on your implementation. For me, incremental updates work much faster.


>
>best
>daniel

• Re: incremental attack tables? Daniel Shawul 00:57:36 05/05/04
  • some pseudo code Daniel Shawul 01:20:18 05/05/04
    • Re: some pseudo code Omid David Tabibi 01:35:54 05/05/04
      • Re: some pseudo code Omid David Tabibi 01:37:17 05/05/04
        • Re: some pseudo code Daniel Shawul 01:46:27 05/05/04

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.