celechii

known cat petter

  • they/she

genderfluid dumbass full of love amongst other things

i make games at ko_op :)

cat counter: 291 (record: 523)


game makin streams
twitch.tv/celechii
@chocolatinebabe (ffxiv account (fishing))
cohost.org/chocolatinebabe

:host-cry: TRAGEDY :host-cry:

local girl tries to compress TWO (2) 0-11 integer pairs and ONE (1) boolean into a single byte and calculates she needs TWO HUNDRED SIXTY FOUR (264) unique values to account for every permutation


You must log in to comment.

in reply to @celechii's post:

before anyone tries to calculate this for me, im compressing double card calls which have a structure of

  • cardAIndex (0-11)
  • cardBIndex (0-11)
  • isALargerThanB (bool)

where cardAIndex will never be the same as cardBIndex, and ideally i want to preserve the order of A and B which makes this 12 possible cardAs times 11 possible cardBs times 2 possible A>B variations and 12 x 11 x 2 is 264

it's both for the numbers and for maintaining expression! 5 < 7 and 7 > 5 are mechanically the same, but i want to maintain the distinction between saying "card 7 is bigger than card 5" and "card 5 is smaller than card 7"

i am not trying to compress a comparison, i am trying to compress the exact wording of the assertion "card 7 is bigger than card 5". if the exact wording didn't matter then i'd just put both numbers next to each other since you only need 4 bits to store anything less than 16

Ah, I think I'm starting to get it. For some reason I was thinking it was a card with the number on it, not an index to a card. So these examples are comparing the 5th and 7th cards, not the other way around?

Yeah, doing that is more difficult. Having trouble thinking of a solution unless there's a way to compress multiple meanings into a single bit.