Search found 2029 matches

by Michel
Thu Jul 18, 2019 12:43 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Self-taught AI solves Rubik's cube
Replies: 20
Views: 2777

Re: Self-taught AI solves Rubik's cube

https://www.nature.com/articles/s42256-019-0070-z I have not quite understood yet what they do exactly. Ok the use a NN to provide an estimated solution time. The NN is trained to match the estimated solution time to the one estimated from a 1-ply search. In chess this an old idea (match the heuris...
by Michel
Sat Jul 13, 2019 1:46 pm
Forum: Computer Chess Club: General Topics
Topic: Stockfish patches
Replies: 13
Views: 1631

Re: Stockfish patches

The problem is Stockfish maintainers seem to be trigger happy with any microscopic elo gainer heuristic patch, but when it comes to bug fixes, that pr sits there for weeks. The problem is that people often disagree what constitutes a bug (is showing a +5 score in a draw position a bug?). Moreover i...
by Michel
Sat Jul 13, 2019 12:01 pm
Forum: Computer Chess Club: General Topics
Topic: Stockfish patches
Replies: 13
Views: 1631

Re: Stockfish patches

playing 40000 games for every 2 consecutive versions even now will give an unbiased estimate with a possible mistake of 2 elo. Getting an accurate elo assessment of patches (or to do any kind or research at all) was never a goal of fishtest. The idea is that the considerable ressources needed for s...
by Michel
Sat Jul 13, 2019 9:12 am
Forum: Computer Chess Club: General Topics
Topic: Stockfish patches
Replies: 13
Views: 1631

Re: Stockfish patches

They give elo estimate for every change and if you add all the estimates that they publish the elo improvement shouls be clearly higher. You have a basic misunderstanding of statistics. The elo estimate calculated by fishtest is (median) unbiased over all patches (both failing and passing). In othe...
by Michel
Sat Jun 15, 2019 8:19 am
Forum: Computer Chess Club: General Topics
Topic: Polyglot 64-bit
Replies: 23
Views: 3286

Re: Polyglot 64-bit

Is it not sufficient to replace all int's in the sources book*.c which obviously refer to some position in the book with uint64? I may take up maintaining polyglot again. I find it a shame that polyglot book files after all these years still do not contain a header (for copyright messages, variants,...
by Michel
Tue May 28, 2019 7:00 pm
Forum: Computer Chess Club: General Topics
Topic: TCEC S15, END of an ERA event is much more Brutal than I thought!
Replies: 127
Views: 22857

Re: TCEC S15, END of an ERA event is much more Brutal than I thought!

I haven't been following this closely and I don't really want to get involved, but I can't help but point out that throwing out 8 decisive games because the same side happened to win is a fairly extreme thing to do. I don't know how much confidence can be had in the results as soon as you start bei...
by Michel
Sat May 18, 2019 5:35 am
Forum: Computer Chess Club: General Topics
Topic: SF Dev need 150s (2.5 min) to find Qh6
Replies: 15
Views: 2941

Re: SF Dev need 150s (2.5 min) to find Qh6

It appears SF misses some zugzwang. Sf-dev with Null Move Reduction disabled: info depth 41 seldepth 58 multipv 1 score cp 9 lowerbound nodes 1800916083 nps 35147369 hashfull 252 tbhits 0 time 51239 pv c1h6 info depth 40 currmove c1h6 currmovenumber 1 info depth 41 seldepth 58 multipv 1 score cp 19...
by Michel
Wed May 15, 2019 3:30 pm
Forum: Computer Chess Club: General Topics
Topic: SF Dev need 150s (2.5 min) to find Qh6
Replies: 15
Views: 2941

Re: SF Dev need 150s (2.5 min) to find Qh6

It appears SF misses some zugzwang.
by Michel
Tue Mar 05, 2019 2:49 pm
Forum: Computer Chess Club: Programming and Technical Discussions
Topic: Training the trainer: how is it done for Stockfish?
Replies: 22
Views: 4880

Re: Training the trainer: how is it done for Stockfish?

Regarding: "Very simple. MCTS is the only viable approach given the 80000 nps they got using 4 TPUs." Well, A/B fully replaced any other scheme when computers where much slower than 80Knps, and MCTS never won above A/B in any period of chess engine history...so maybe not so simple :-) Regrading: "i...