Computer Chess Club Archives

Search

Terms

Messages

Subject: Re: Automatic move sorting with piece list

Author: Dann Corbit

Date: 10:33:52 06/03/05

Go up one level in this thread

On June 03, 2005 at 13:05:58, Peter Fendrich wrote:

>On June 02, 2005 at 22:05:10, Dann Corbit wrote:
>
>>On June 02, 2005 at 20:51:03, Joseph Tadeusz wrote:
>>
>>>If I reinsert a captured piece into the piece list it is done
>>>so at the beginning. This has the result that the pieces in the
>>>heart of the action move to the front of the list.
>>>
>>>I noticed that the resulting order has much better search
>>>performance than without such a list and where pieces are
>>>searched randomly.
>>>
>>>It's an unintended but beneficial LRU sorting.
>>
>>Separate piece lists by type and color.
>>
>>Better than a single piece list of all pieces.
>>
>>IMO-YMMV.
>
>
>Why?

Lots of reasons.  The most important is no switching and no branching.

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.