Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: No ! Fischer is (nt)

Author: Tord Romstad

Date: 12:47:39 11/18/03

Go up one level in this thread


On November 18, 2003 at 15:27:22, Dann Corbit wrote:

>You have an array that lists count of attacks by type for each square on the
>board.
>
>From this, you know if any square is "won, equal or lost" and by which side.
>
>You also know (for instance) if it is safe to put a pawn on a square but not a
>knight.  Instantly.
>
>It's also very nice for move ordering.

It is also tremendously useful when making forward pruning, extension and
reduction decisions, when deciding which moves to include in the qsearch,
when deciding whether or not to do a null move search, in the evaluation
function, for static mate detection, and probably a bunch of other
purposes I either don't remember at the moment or haven't thought of
yet.

If I only knew how to make it all work without big lookup tables ...

Tord



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.