Grandmaster-Level Chess Without Search
https://github.com/google-deepmind/searchless_chess[1]: https://hlfshell.ai/posts/deepmind-grandmaster-chess-without...
Say I want to play chess with an opponent that is at about the same skill level as me, or perhaps I want to play with an opponent about 100 rating points above me for training.
Most engines let you dumb them down by cutting search depth, but that usually doesn't work well. Sure, you end up beating them about half the time if you cut the search down enough but it generally feels like they were still outplaying you for much of the game and you won because they made one or two blunders.
What I want is a computer opponent that plays at a level of my choosing but plays a game that feels like that of a typical human player of that level.
Are there such engines?
The best neural network chess engine's authors wrote about this deepminds publication.
On lichess puzzles gpt4o with the compiled prompt is around 70%, I think the 270M transformer is around 95%
This implies the model is around 2500 blitz vs humans. As blitz elo are often much higher than in classical time controls, 2500 elo on chess.com places it firmly in the 'good but not great' level.
I am very curious to know whether the model suffers from the same eval problems vs the well known "anti-bot" openings that stockfish is susceptible to at limited search depths.
Why compare this to GPT-3.5-turbo-instruct? Is that near SOTA in this space?
Grandmaster-Level Chess Without Search
"What would Stockfish Do?"
A more appropriate title; because Stockfish is a search-base system and DeepMind's approach wouldn't work without it.
Oh, btw, this is (yet another) a Neurosymbolic system of the "compiling system 2 to system 1" type.