Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Move table

Author: Bruce Moreland

Date: 01:16:39 01/12/99

Go up one level in this thread



On January 12, 1999 at 00:11:02, KarinsDad wrote:

>On January 11, 1999 at 23:01:45, Robert Hyatt wrote:
>
>>On January 11, 1999 at 17:44:02, Bruce Moreland wrote:
>>
>>>
>
>[znip]
>
>>>
>>>If I were writing a program today I think I would try this first.
>>
>
>Now you guys tell me. After I started using BitBoards for both my evaluator and
>for my legal move generator.

I don't use either of these methods, I use a legal move table as in gnu-chess,
although my element size is pretty big, since I store a lot of other gunk in
there.

For example, one component of my eval is piece-square tables.  If you want to
incrementally keep track of the positional value, you'd normally subtract out
the value of the "from" square and add in the value of the "to" square, for a
given piece and color.  I have the value right there in the table, so I can just
add it in without calculating indexes.

There are drawbacks, no doubt, but it works OK, meaning that I think that people
have written slower programs while using faster generation schemes.

bruce



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.