TalkChess.com

Full data snapshots are updated as of today, and previously proprietary storage engine is now fully OSS.

People like H shouldn't have done what they did, however, there is not so much for "good faith" in computer chess programming anyways, this forum is full of it and I'm gladly contributing my part.

A new snapshot has been made available for download which includes all evaluation data(about 10 billion unique positions) as of yesterday.

Raise stack reserve size. Inlining this function causes stack overflow.

With regional IP block, you sure you are preventing more hackers than normal users?

If your alien race is far more advanced then I see no reason to send our poor imitations of human intelligence than our top human chess player. Their computers will probably run our crappy programs much faster but our biological evolution and individual personalities are something they will never ha...

Well there is the problem: people so far have no meaningful way to describe how those networks work. Currently networks contain huge number of parameters and they correlate in mysterious ways to produce the outputs, that is also why large numbers of games are needed to train those networks so that t...

To simplify what I said, or I understand you correctly about the approach: Take a position with a few pieces, a bit more than(or within) existing EGTB coverage, and start generating games, train on the resulting games and try to improve the next iteration until it can predict the correct move with h...

Well, this usually ends up with some very over-fitted networks because you are intentionally limiting its training sample diversity. Such raw database exists, with billions of positions and most of their moves analyzed at reasonable depth, although I fear it is never going to be enough to train a ne...

There is a conceptional difference between "an exhaustive enumeration of subsequent positions given a certain position" and "an exhaustive enumeration of every possible positions given a certain set of material". The former is essentially a search without any pruning, functionally being a special ca...