Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

I went through this process many years ago and documented it here https://triplehappy.wordpress.com/2015/10/26/chess-move-comp...

Basically I demonstrate how you can compress to much less than one byte per move, but settle instead on a one byte per move scheme that is also very performant, something you'd have to sacrifice for optimal compression. I used this one byte representation to good effect in my chess GUI Tarrasch https://triplehappy.com



There was also a lengthy off-topic discussion about the compressed board representation this year [1].

[1] https://news.ycombinator.com/item?id=39065595




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: