Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: History heurstic

Author: Michel Langeveld

Date: 07:18:21 02/08/04

Go up one level in this thread


On February 08, 2004 at 08:04:02, Volker Böhm wrote:

>Hi,
>
>I have implemented a combination, I thik.
>Question: Piece square tables are static tables build in your chess program?

Yes, I use for this "static" tables.
Nullmover has 3 kinds: opening, middlegame, endgame for pawn, pawn, bishop,
knight, rook, queen, king . 3x7 = 21 lists. I have for black and white each an
own list for speed issues. So I have 42 lists at start up.

>If yes I do the following:

>Build 9 move lists.

What 9 movelists?

>Put every move to one of this lists from the static piece
>square table (example pawn moves to 7-th rank gets to the top list).
>Sort every move in one bucket by history (from-to).

I try to understand what you wrote but don't get it.
Can you explain this a bit more?

>Works best for me. Reduces amount of sorting time.
>
>Greetings Volker



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.