• Welcome to SpeedSolving.com — the world’s largest puzzle community!

    You’re currently browsing as a guest, which means you have limited access to discussions, resources, member profiles, and community features.

    Join 50,000+ cubers and puzzle enthusiasts from around the world to ask questions, share solves, improve faster, and be part of the community.

    Registration is free, fast, and easy — create your account today.

    Already a member? Log in here to hide this message and start participating.
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
 
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.
 
Back
Top