4 ms·
Total number of states = 11^16, assuming you don't reach 2048, just like you don't actually kill the king in chess. Now log_2(11^16)=55.34, thus 56 bits are su
by enriquto 1y ago
Total number of states = 11^16, assuming you don't reach 2048, just like you don't actually kill the king in chess.
Now log_2(11^16)=55.34, thus 56 bits are sufficient. That's tight!
- nine_k 1y agoEncode them in CJK and combining Unicode characters, to keep the visual representation as short as possible.