I wrote down some notes regarding upcoming repetition detection I've been working on recently.
http://marcelk.net/2013-04-06/paper/upcoming-rep-v2.pdf

I just received news that this now got implemented in Stockfish and apparently passed "fishtesting".
http://tests.stockfishchess.org/tests/view ...

Easiest is to look in Docs/fingerprint :

CountLoc v1.6.2, (c) 2015 mar
-------------------------------------------------------------------------------
Type Files Blank Comment Punctuation Code
-------------------------------------------------------------------------------
C source 14 819 950 457 ...

Floyd is a simple, bare-bones, chess engine for study purposes. It is designed for Windows, Linux and OSX and distributed under the permissive, "2-clause" or "simplified", open source BSD license.

The Floyd project is primarily intended as a platform for experimentation. This means that emphasis is ...

In Rookie I communicate between tuner through stdin/stdout which gives overhead indeed. I do ("did", this was all in 2010), 2-ply searches to make the best of the communication overhead. I also did it in batch mode: [generateInput--> engine --> processOutput] and not in back and forth mode [tuner ...

Harvey Williamson wrote:

marcelk wrote: The CSVN uses a small checklist for inspections. This is mentioned in the checklist.

Good to know you have at least 2 checklists

Better than having none.

I am not interested in this individual incident. Just that you have to be sure that the source supplied matches the engine that plays.
The CSVN uses a small checklist for inspections. This is mentioned in the checklist. This is also the reason the rules require the programmer to provide access to ...

ernest wrote:

marcelk wrote:There is a version with Murray Campbell's narrative over it,

Where is it ?

https://computer.vhx.tv/buy

There is a version with Murray Campbell's narrative over it, explaining the events and backgrounds. He clearly relates to it. Very much recommended.

Yes, but syzygy WDL tables account for the 50 move rule. So that should solve the problem, no? In some (extremely rare) complicated wins, the path to win chosen by the engine may be very slow and laborious, but it should eventually win.
The WDL tables assume the halfmove clock to be zero. In other ...

The answer is to use Monte Carlo testing. Have the program play a hundred million random games (each move picked at random for both sides until a mate or draw). After each move, the retro generator is run and a test is made to verify that the move just made had been retro generated. Simple and easy ...