Author: Reinhard Scharnagl
Date: 08:45:29 09/06/04
Go up one level in this thread
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.
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.