Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: perft records

Author: Reinhard Scharnagl

Date: 10:24:40 09/06/04

Go up one level in this thread


On September 06, 2004 at 13:06:24, Uri Blass wrote:

>On September 06, 2004 at 12:17:48, Reinhard Scharnagl wrote:
>
>>On September 06, 2004 at 12:03:44, Uri Blass wrote:
>>
>>>On September 06, 2004 at 11:45:29, Reinhard Scharnagl wrote:
>>>
>>>>Uri,
>>>>
>>>>I have made a little additional test (without mate detecting):
>>>>
>>>>FEN: rnbqkbnr/pppppppp/8/8/8/8/PPPPPPPP/RNBQKBNR w KQkq - 0 1
>>>>
>>>>  +-*--b--c--d--*--f--g--*-+ MS Visual Studio C++ Version 13.10
>>>>8 |[r][n][b][q][k][b][n][r]|
>>>>7 |[p][p][p][p][p][p][p][p]| Perft Testseries
>>>>6 |   :::   :::   :::   :::|
>>>>5 |:::   :::   :::   :::   | (without caching)
>>>>4 |   :::   :::   :::   :::|
>>>>3 |:::   :::   :::   :::   | Test #:      00
>>>>2 |<P><P><P><P><P><P><P><P>|
>>>>1 |<R><N><B><Q><K><B><N><R>| Break Time 75.0 Sec.
>>>>=>+-*--b--c--d--*--f--g--*-+
>>>>
>>>>Ply     Nodes    all (x)   (e.p.)    all (+)      (#)    Promot.    Castl. Sec.
>>>>-------------------------------------------------------------------------------
>>>>1          20          0        0          0        0          0         0    0
>>>>2         400          0        0          0        0          0         0    0
>>>>3        8902         34        0         12        0          0         0    0
>>>>4      197281       1576        0        469        0          0         0    0
>>>>5     4865609      82719      258      27351        0          0         0    0
>>>>6   119060324    2812008     5248     809099        0          0         0    6
>>>>7  3195901860  108329926   319617   33103848        0          0    883453  150
>>>>-------------------------------------------------------------------------------
>>>>
>>>>It seems to be about 10% faster without checking for mates.
>>>>
>>>>Those 10% seem to be the prize if one wants to have also that information.
>>>>
>>>>Regards, Reinhard.
>>
>>>Thanks for this information
>>>What is the prize for detecting checks?
>>>
>>>I have a legal move generator but I detect checks today only during make move
>>>and not during move generation.
>>>
>>>Uri
>>
>>Hi Uri,
>>
>>The detecting of checks is so essentially integrated within my move generation,
>>that it hardly could be switched off without rewriting the whole approach. Thus
>>I cannot provide you with that requested value, sorry.
>>
>>But have a look at following statistics in calculating secure fields the king
>>would be able to move on: [http://www.chessbox.de/Down/CRC_Test_01.txt]
>>
>>Reinhard.

>I do not understand the meaning of the statistics in that link.
>
>Uri

Sorry for that. One problem is, that I develop such things from alone, so it
could happen, that I do not use the vocabulary you may be used to.

There is a routine, testing, whether a king could be placed at a specified
field or not. In that statistic such fields had been calculated. And those
squares, where the king would be threatened by check, contain the type of
piece, characterizing the type of check. That is not always the piece which
is threatening, but it simply could be a partially aspect of that piece.

Smirf does not use bitboards, but bit encoded properties building up pieces
double linked and sorted into two lists, standing in a 15x14 board. I am very
sure, you never have heared from such a data structure for chess.

Reinhard.



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.