So there's this card game called Spot It. There are 55 cards each with 8 symbols on it. Typically the game is played where a target card is flipped up and players try to match the next card from their hand to the target card.
The interesting thing about Spot It is that every card shares exactly 1 matching symbol with every other card in the deck. This is due to a combinatronic trick.
The number of cards and symbols C are calculated like so:
C = q² + q + 1
And the number of symbols per card S is
S = q + 1
So, for any value of q you can figure out a set of symbols and cards that operate the same as Spot It.
Now, the thing that caught my attention while playing Spot It is how when I commit to playing a card, it completely changes the strategy everyone else must use, because now they must match their card to my card rather than the target card. Each card that is played totally resets the symbol matching process.
There are no turns. When someone plays a card, it creates a checkpoint in time that alters the game state and completely changes each player's strategy.
I have been interested in how to establish a chronology of events in a trustless way without a blockchain. I am curious if this symbol matching mechanism could be abtracted to a cryptographic operation where each commitment by a party changes the requirements for the next commitment. If the commitment is linked to an event or action, it could establish a definitive ordering of events even when no trusted clock is available.
There may be better ways to do this already, such as collaborative hash chains, but I still think the idea is worth exploring.
Another interesting aspect of this combinatronic trick is that you can visualize the set of cards and symbols with lines and points respectively. You can draw the points and connect them with lines such that each point has exactly S lines and any two lines may only share 1 point. It gets really difficult after q=2 but I did it for q=3 😅
arkinox
npub1ar…rh43w
2024-10-18 15:31:25
in reply to nevent1q…6f4p
Author Public Key
npub1arkn0xxxll4llgy9qxkrncn3vc4l69s0dz8ef3zadykcwe7ax3dqrrh43wPublished at
2024-10-18 15:31:25Event JSON
{
"id": "d3fd43e4cfccdacf49b38cf64ebf4f0c03bf104df069ae472577ad51cc0c14aa",
"pubkey": "e8ed3798c6ffebffa08501ac39e271662bfd160f688f94c45d692d8767dd345a",
"created_at": 1729265485,
"kind": 1,
"tags": [
[
"e",
"40c7f7a5946b7be51f39b921eb6cdc45b8c44ad9ca8ca6d5a0bc5d74a43afe60",
"",
"root"
],
[
"e",
"a22f0bb44a1eac335bcdf5223a5ba262ec3266691a552b1fdff980bc7ac318b7"
],
[
"e",
"556fdc2e40bec033b55d606a155e805681c98bcfaeff68e9eac142690d095aa3",
"",
"reply"
],
[
"p",
"e8ed3798c6ffebffa08501ac39e271662bfd160f688f94c45d692d8767dd345a"
],
[
"p",
"c072b5c9d9a2cf5dc4df48fefa972550dee848f12bcbfd5a77b9f8cafd926a0f"
]
],
"content": "So there's this card game called Spot It. There are 55 cards each with 8 symbols on it. Typically the game is played where a target card is flipped up and players try to match the next card from their hand to the target card.\n\nThe interesting thing about Spot It is that every card shares exactly 1 matching symbol with every other card in the deck. This is due to a combinatronic trick.\n\nThe number of cards and symbols C are calculated like so:\n\nC = q² + q + 1\n\nAnd the number of symbols per card S is\n\nS = q + 1\n\nSo, for any value of q you can figure out a set of symbols and cards that operate the same as Spot It.\n\nNow, the thing that caught my attention while playing Spot It is how when I commit to playing a card, it completely changes the strategy everyone else must use, because now they must match their card to my card rather than the target card. Each card that is played totally resets the symbol matching process.\n\nThere are no turns. When someone plays a card, it creates a checkpoint in time that alters the game state and completely changes each player's strategy.\n\nI have been interested in how to establish a chronology of events in a trustless way without a blockchain. I am curious if this symbol matching mechanism could be abtracted to a cryptographic operation where each commitment by a party changes the requirements for the next commitment. If the commitment is linked to an event or action, it could establish a definitive ordering of events even when no trusted clock is available.\n\nThere may be better ways to do this already, such as collaborative hash chains, but I still think the idea is worth exploring.\n\nAnother interesting aspect of this combinatronic trick is that you can visualize the set of cards and symbols with lines and points respectively. You can draw the points and connect them with lines such that each point has exactly S lines and any two lines may only share 1 point. It gets really difficult after q=2 but I did it for q=3 😅",
"sig": "df61f021fd7dbc1f00021baf490e7cb4b30ee5b84adb216307a7154f596d05fe8979f7916a9959940eb9da25ddc159b5c8b7f7c6c7cb1bff97a764cfe8b20ce3"
}