Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
chipsrafferty
on Sept 16, 2023
|
parent
|
context
|
favorite
| on:
How to store a chess position in 26 bytes using bi...
It seems, then, if you wanted to efficiently store lots of positions, it would be smart to store a large list of openings, a large list of following sequences, and then your positions can be stored as a list of sequence ids.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: