Code: Select all
kernel: [84966.051797] crystal[26855]: segfault at b3a0000017d ip 000000000042095f sp 00007f4342fc6490 error 4 in crystal[400000+3e000]
[EDIT] Was actually using MultiPV = 2.
Moderators: hgm, Rebel, chrisw
Code: Select all
kernel: [84966.051797] crystal[26855]: segfault at b3a0000017d ip 000000000042095f sp 00007f4342fc6490 error 4 in crystal[400000+3e000]
My version of Crystal (crusty) either crashed or lost on time...dunno yet..still checking...the more books the more time issueszullil wrote: ↑Thu Sep 05, 2019 5:23 pm Very preliminary report. Crystal v1.1 (bench 7410759) segfaulted:
Using 16 threads, 16384 MB hash, all other settings at default. Linux.Code: Select all
kernel: [84966.051797] crystal[26855]: segfault at b3a0000017d ip 000000000042095f sp 00007f4342fc6490 error 4 in crystal[400000+3e000]
[EDIT] Was actually using MultiPV = 2.
I have seen no crashes here but this in my modified version of Crystal. I hope Joseph does not mind my making a fork of sorts, nothing officicial. It is called Palantir Crystal To keep it bit in Lord of the Rings territory and assuming Crystal is something like a crystal ball.zullil wrote: ↑Thu Sep 05, 2019 5:23 pm Very preliminary report. Crystal v1.1 (bench 7410759) segfaulted:
Using 16 threads, 16384 MB hash, all other settings at default. Linux.Code: Select all
kernel: [84966.051797] crystal[26855]: segfault at b3a0000017d ip 000000000042095f sp 00007f4342fc6490 error 4 in crystal[400000+3e000]
[EDIT] Was actually using MultiPV = 2.
Code: Select all
// Step 13. Extensions (~70 Elo)
if ( gameCycle
&& (alpha > VALUE_DRAW || (ss->ply % 2 == 0))
&& (depth < 5 * ONE_PLY || PvNode))
extension = (2 - (ss->ply % 2 == 0 && !PvNode)) * ONE_PLY;
// Singular extension search (~60 Elo). If all moves but one fail low on a
// search of (alpha-s, beta-s), and just one fails high on (alpha, beta),
// then that move is singular and should be extended. To verify this we do
// a reduced search on all the other moves but the ttMove and if the
// result is lower than ttValue minus a margin then we will extend the ttMove.
if ( // else removed here
Which puzzle test was it? ACT from Rybka-Forum? But ACT has 287 pos.corres wrote: ↑Fri Sep 06, 2019 3:27 pm ...
I repeated the endgame puzzle test (solving time was 90 sec/position) and I got:
1. Crystal 300819 (v1.1) - 271 solved out of 286 (average solving time = 6.4sec)
2. Stockfish 190825 - 259 solved out of 286 (average solving time = 9.3sec)
So Crystal is a good puzzle solver but it is weak for playing games and analyzing normal chess positions,
the endgame positions may be the exceptions.
http://www.mediafire.com/file/8yxjk8dq9 ... 6.2019.zipPaloma wrote: ↑Sat Sep 07, 2019 12:11 amWhich puzzle test was it? ACT from Rybka-Forum? But ACT has 287 pos.corres wrote: ↑Fri Sep 06, 2019 3:27 pm ...
I repeated the endgame puzzle test (solving time was 90 sec/position) and I got:
1. Crystal 300819 (v1.1) - 271 solved out of 286 (average solving time = 6.4sec)
2. Stockfish 190825 - 259 solved out of 286 (average solving time = 9.3sec)
So Crystal is a good puzzle solver but it is weak for playing games and analyzing normal chess positions,
the endgame positions may be the exceptions.
I used the .pgn file, as you could guess it.
O.K.