Chess is beaten (machines can play a perfect game) when there are up to 7 pieces on the board.
This might seem like a simple question of compute power, but clever implementation matters. If you can effectively compress your DB, you can use a bigger one!
miniblog.
Related Posts
In LSP, a position is represented as a line number and a column offset (in Unicode code units): https://microsoft.github.io/language-server-protocol/specifications/lsp/3.17/specification/#position
This is pretty elegant. You'll get the correct line regardless of encoding bugs, and the editor already knows the line number so it's cheap to compute.
The Bitter Lesson: how implementing generic search and scaling compute outperforms custom logic in many situations:
An introduction to polyhedral compilation, with a worked example showing how you compute relevant linear transforms: https://www.youtube.com/watch?v=iAF-orse4hE