• Welcome to the Speedsolving.com, home of the web's largest puzzle community!
    You are currently viewing our forum as a guest which gives you limited access to join discussions and access our other features.

    Registration is fast, simple and absolutely free so please, join our community of 40,000+ people from around the world today!

    If you are already a member, simply login to hide this message and begin participating in the community!

Ollie

Member
Joined
Mar 31, 2012
Messages
2,848
Location
London, UK
WCA
2012FROS01
YouTube
Visit Channel
I assume he means list of 4 letter strings with no corresponding WCA ID's, AAAA would be one of them.

I calculated 440741 combinations that have been unused. Definitely too many to list!

Lazy/bad R code:

Code:
library(data.table)

## calculate all possible ID combinations
test <- expand.grid(letters, letters, letters, letters)
test <- paste0(test$Var1, test$Var2, test$Var3, test$Var4)

length(test) # 456976

# used IDs
df <- fread("WCA_export_persons.tsv", select = 1)
df <- unique(substr(df$id, 5,8))

length(df) # 16235

# unused IDs
length(test) - length(df) # 440741
 

Torch

Member
Joined
Aug 6, 2013
Messages
1,441
Location
Austell, GA, USA
WCA
2014GOSL01
YouTube
Visit Channel

CJK

Member
Joined
Nov 11, 2015
Messages
61
WCA
2015KOEN01
Would it suffice to only check the people with 1 nemesis?
After I rethought about this, the answer is no:
Imagine if two people are at #WR1 and #WR2 in all events, but not nemesis of each other and a third person is at #WR3 in all events, then the third one has two nemesis but is still the one with lowest SoR out of everyone who has at least one nemesis.
 
Top