Open Carreau opened 2 years ago
Talking with @danielballan, he suggested putting the cad on a cycle, and finding way to count the number of nodes to go from A to B in clockwise and anticlockwise direction, and the smallest one give us which card wins.
There might be also some things we can use out of dobble game that uses projective plane math to make sure two cards only have a single symbol in common.
I guess rock--paper-scissors is an example of such a game. One useful train of thought may be to consider how to extend that to N objects in a graphical way.
what about vector product if two object are on a 2D plane ?
On Sun, Jul 17, 2022 at 10:08 Dan Allan @.***> wrote:
I guess rock--paper-scissors is an example of such a game. One useful train of thought may be to consider how to extend that to N objects in a graphical way.
— Reply to this email directly, view it on GitHub https://github.com/Quansight/scipy-2022-swag/issues/2#issuecomment-1186544262, or unsubscribe https://github.com/notifications/unsubscribe-auth/AACR5T4P5RX2YCUMWNTI4S3VUQOVLANCNFSM53YG37JQ . You are receiving this because you authored the thread.Message ID: @.***>
Yeah, that seems doable mentally. How does it determine which card “wins”?
How does it determine which card “wins”?
Whatever is positive. As A^B = - B^A as long as you have a convention to consider your card first that should be good.
That makes sense!
If each card gets a 2D coordinate there are several games that might be possible: battleship is one.
There are games know as "intransitive", basically A > B > C > A, so thre can't be any "winner". It would be good to figure out how to make this automatically for trading cards after giving them statistics, like attack/defence.