« first day (4 days earlier)      last day (1071 days later) » 

Nathan Merrill
Nathan Merrill
01:55
I think that tournaments (graph theory) would be a good area for asynchronous stuff
Creating a tournament, and repeatedly finding the queen subset of the tournament would be interesting
PhiNotPi
PhiNotPi
@NathanMerrill What is the queen subset?
Nathan Merrill
Nathan Merrill
02:10
A queen is defined to be a node that "beats" all other nodes. N1 "beats" N2 if:
N1 directly won against N2 or,
N1 directly won N3 who directly won N2
Its proven that every tournament has at least 1 queen
 
9 hours later…
PhiNotPi
PhiNotPi
10:57
Is that related to the Smith set?
Link for the initiated: en.wikipedia.org/wiki/Smith_set
@NathanMerrill Are you talking about the Smith set as a scoring mechanism?
 
8 hours later…
Nathan Merrill
Nathan Merrill
19:29
@PhiNotPi I don't know if those are the same, but both are interesting

« first day (4 days earlier)      last day (1071 days later) »