TalkChess.com

sorry but i don't undersand why you compare razoring with probcut. the former work at low depth, the latter at high depth. I suspect that razoring ( do a quiscence search at low depth) is very similar to futility pruning ( at low depth, skip a lot of quiet moves). this is my point of view, but I can...

I'm just off topic, but if you like you can use an extension of gcc and clang using Score = int __attribute__ ((vector_size (16))); // a vector of int of size 16 bytes Score a = {1,2,0,0}; Score b = {5,-6,0,0}; Score res = a + b;// {6,-4,0,0} Score res2 = 2 * a; // {2,4,0,0} it will use simd instruc...

sorry, what do you mean by SHT? Shared transpositio table?

xr_a_y wrote: ↑

Fri Jan 03, 2020 9:36 am

- On another hardware (a dual xeon with 20 cores), single thread perf is 800knps and it scale bad very soon, final perf beging around 23Mnps

what does it means? 28X with 40 cores?
how does it scales another program i.e.stockfish on the dual xeon with 20 cores?

Back on the same subject ... I'm trying to investigate why Minic is slow. .... .... I don't get why SMP Minic is so slow at TCEC ...only 70Mnps on 176 threads, where many others are around 120Mnps I don't have understood if minic is slow or if it's slow only on 176 threads. Depending on this answer...

my time management algorithm is quite simple when pondering. Vajolet starts pondering then as soon as a "ponderhit" is received the standard time management starts and Vajolet allocate time based only on his own time. I do the same when playing in real chess, I ponder on the opponent time, but as so...

I got the best speed with clang

stockfish authors report directly in their code an elo gain of ~60 Elo

regarding the first question I don't have an answer, regarding the second one (king moves) remember that Texel move generator create a list of pseudo legal moves, is the search that check that the move is legal before making the move. Probably it has been measured that this way of generating moves, ...

no, change mate score when saving and retrieving from TT. look at stockfish code :) line 1375 of search.cpp, take a look at value_from_tt posKey = pos.key(); tte = TT.probe(posKey, ttHit); ************** ttValue = ttHit ? value_from_tt(tte->value(), ss->ply, pos.rule50_count()) : VALUE_NONE;********...