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
An interesting feature of the Grok TiddlyWiki interface: it has the sidebar on the right.
I see a sidebar on the left way more often, but arguably it makes more sense on the right for a wiki? The content is effectively more prominent.
Strategies for ramping up, working effectively and having fun when you're not using a mainstream programming language: https://morepablo.com/2022/09/so-you-re-using-a-weird-language.html
Difftastic is effectively computing the "tree edit distance" between two ASTs, and there's a bunch of papers on this topic. Literature review is hard though: sometimes a paper takes a while to digest, only to realise that they're solving a slightly different problem.