News for hackers. Stuff that matters.
Re:Compressing Chess Moves for Fun and Profit by adrianmonk on Friday March 15, 2024 @05:48PM (#39721082)
> Let an engine assign each legal move m some probability p of being played.

This assumes you're storing moves of players who are good at chess!

Re:Compressing Chess Moves for Fun and Profit by cjbprime on Saturday March 16, 2024 @12:08AM (#39723314)
No, it just saves more space when the players are good. (Note the engine assigns each legal move a probability.)
Re:Compressing Chess Moves for Fun and Profit by adrianmonk on Saturday March 16, 2024 @02:43AM (#39723833)
They said one can do better on average this way. That conclusion does rest on an assumption.

Anyway, I wrote it in the form of a joke, but I was trying to suggest that for optimal compression, you may need to model how a player actually plays, not how they should ideally do it.

Re:Compressing Chess Moves for Fun and Profit by sudosysgen on Saturday March 16, 2024 @01:03PM (#39727549)
On the flipside, if the player is not good, the moves might take more space but there might be fewer of them :)