Re^3: [OT] Is It Possible To Serialize A Chess Board In Fewer Than 23 Bytes?

I thought about capturing but the "naive (sic) approach" got already long.

> You'd need a length prefix or more bits to encode that a piece is off the board.

Nope. Two pieces can't be on the same field and at least one king must be left. Just position a piece on the (remaining) king to encode capturing.

This discussion is getting useless anyway, BC if the complexity of the task and fuzzy edge cases.

I'd like to see a count of possible board combinations first.

IIRC you have also to encode if a match stops because of resignation or a draw or a stalemate...

So many details.

Cheers Rolf
_{(addicted to the Perl Programming Language :)

see Wikisyntax for the Monastery}

Comment on Re^3: [OT] Is It Possible To Serialize A Chess Board In Fewer Than 23 Bytes?

Replies are listed 'Best First'.
Re^4: [OT] Is It Possible To Serialize A Chess Board In Fewer Than 23 Bytes? by ikegami (Patriarch) on Mar 11, 2026 at 13:57 UTC
IIRC you have also to encode if a match stops because of resignation or a draw or a stalemate... As previously mentioned, if an end state is desired, a special value for the leading bitmap could be used.	[reply]