> ... have collected statistics on which openings will lead to situations where Stockfish (or LeelaZero, or Komodo, etc. etc) will inevitably fail.
In case of Stockfish and other "conventional" engines, yes.
However, with engines like LeelaZero those weaknesses gets much harder to exploit, since you can create your own version of Lc0 by training a new model with tensorflow.
No one knows how to integrate the endgame tablebases into LeelaZero by the way. So if we both play LeelaZero for the first 40 moves, but I switch to Stockfish + 7-man Tablebase for the ending, I'm probably going to beat you. LeelaZero's endgame really is quite weak.
---------
If you are a programmer, and can figure out how to integrate the Neural-Net evaluation into MCTS to evaluate tablebases, you probably would do great. Its currently unsolved (to my knowledge).
It seems solvable... I don't see any reason why MCTS couldn't have a if(popcnt(bitboard) < 8) doTablebase() statement somewhere. The question is how to do it as quickly as possible, and how to do it asynchronously and integrate the statistics to the rest of the MCTS tree.
BTW: A research team has created the 8-man Tablebase, although it takes probably 100s of TB to store. This means that 8-man Tablebases will remain as Hard-drive only for now.
This philisophical split is also in the speedrunning community. The tool-assist players aim for absolute perfection: what would a "perfect run" actually look like? They make recordings at 1/60th of a second, and have a computer input the sequence of buttons with absolute perfect accuracy.
Or, are you a human-only player, who values skill and training?
There's something to be said about the two sides. But I find myself preferring the "theoretical perfection" side... as just my personal taste. I can see why people prefer the skill-and-hard work approach though.
The 'perfect game' is something that a computer will one day find, a curiosity but just like a math proof ultimately just a thing waiting to be discovered, not achieved.
An unknown chessplayer bet a lot of money, that he could play live & simultaniously against two grandmasters and achieve at least 1 point. The two matches were played in different rooms next to each other. No one except the unknown player was allowed to switch rooms during the matches (to not disturb the grandmasters). Obviously he played White against one grandmaster, Black against the other, and won his bet.
As I sometimes tell this anecdote, I wonder what its actual source might be?
I'm pretty confident, this never happend in real, as I expect no grandmaster could get scammed that easily. But the story could be rooted in a "catch me if you can"-like movie or novel or something.
If someone knows more, I would be happy for a hint...
https://en.chessbase.com/post/derren-brown-s-che-trick-once-...
Hardcore "no rules bared" chess is correspondence chess, where you have 24-hours between moves and can use whatever means necessary to make the best move.
If you think just buying a supercomputer and running Stockfish (or LeelaZero) will win, then you don't know anything about opening databases. All the good correspondance chess players have already run Stockfish / LeelaZero across many different openings, and have collected statistics on which openings will lead to situations where Stockfish (or LeelaZero, or Komodo, etc. etc) will inevitably fail.
These computer AI chess programs have weaknesses. A "Cyborg" team, composed of a human guiding Stockfish (or LeelaZero) through opening books can get further than any computer alone, and likely push the opponent into a subtly failing position.
-------
The article talks about it a bit in Centaur Chess section. That's probably where the biggest challenge lies in the future. Centaurs have access to the 8-man database, you keep opening-books secret, and you spend time studying how Stockfish, Leela Zero, or Komodo (or other engines) makes mistakes.
Or, you write your own engine, and try to use that as an edge.