Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Natural move generation with bitboards (was Re:significant math)

Author: Alessandro Damiani

Date: 11:01:19 11/22/02

Go up one level in this thread


On November 22, 2002 at 13:38:50, Sune Fischer wrote:

>On November 22, 2002 at 12:52:54, Alessandro Damiani wrote:
>
>>>You still need that NxQ pattern and all the others in your move ordering.
>>>
>>>I suppose one could just OR them together.
>>>
>>
>>We can generate NxQ captures one at a time. I didn't think further to see if SEE
>>can be done more efficient with Steffan's method.
>
>Most likely there won't be a match to NxQ pattern at all, so it would be faster
>to do 1 check than 8 checks here (ie running all directions in parallel).
>
>>Steffan? You wrote someting you name SME? Does it include a SEE?
>
>I think so, the idea (or at least my way) is to make a general static
>evaluation. I posted some positions a week ago or so, the SEE from Crafty
>doesn't deal with promotions or non-captures.
>
>I think it doesn't matter too much with the non-captures, you just want
>something decent and fast there, SME may be overkill.
>However I generate promotions along with captures, so I need to sort these along
>with captures and the promotions may or may not be captures.
>
>Promotion to a queen could be a better move than winning a knight, but if the
>promoted queen is lost instantly winning a knight may be better, so there is a
>problem with regular SEE.
>

I agree. I use a simple SEE for captures. And SEE already costs enough.

Alessandro



This page took 0.01 seconds to execute

Last modified: Thu, 07 Jul 11 08:48:38 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.