News for hackers. Stuff that matters.
Re:Compressing Chess Moves for Fun and Profit by perihelions on Friday March 15, 2024 @03:55PM (#39719995)
For example: "this position, but a few of the pieces can be in different places". (Maybe penalizing pawn moves with a higher weight—a pawn move is in practice a "larger change" to a position than a piece move).

This version is easy to formalize: it's just querying a bitstring x \in {0,1}^N, a bitboard vector representation of a chess position, and asking if there's any other needles within a short Hamming distance. I haven't a clue how to solve that (or if it's solvable at all).

Re:Compressing Chess Moves for Fun and Profit by kevindamm on Friday March 15, 2024 @11:47PM (#39723212)
I wonder if shingle hashes might help a lot here...

https://en.wikipedia.org/wiki/MinHash