Win the competition king-of-the-hill
Write a Javascript anonymous function that, given two functions as strings, deterministically picks one as the winner and returns 1 if the first input wins and 2 if the second input wins. The choice must not depend on the order of inputs (that is, for any given input pair, the same program must always win no matter which one is first).
Every submission will be used to compare all unordered pairs of all solutions except self. Every time a program is chosen as the winner, it is assigned 1 point.
Submissions must not store any information between runs, interfere with the controller or somehow destroy my computer. There is no hard time limit, but intentionally creating an excessively slow solution counts as destroying my computer. Submissions must not duplicate other submissions or be longer than 200 KiB. Submissions must not rely on the input functions always halting (that is, they must not execute them or any parts of them).
You should give your submissionssubmission a name (it should match the regex [A-Za-z ]+ and not coincide with any other solutions).
Controller in a snippet:
document.write(atob(`PCFkb2N0eXBlIGh0bWw+CjxodG1sPgo8Ym9keT4KPHNjcmlwdD4KCWZ1bmN0aW9uIGFkZFByb2dy
YW0oKQoJewoJCWxldCBwcm9ncmFtc0xpc3QgPSBkb2N1bWVudC5nZXRFbGVtZW50QnlJZCgicHJv
Z3JhbXNMaXN0Iik7CgkJbGV0IHVsID0gZG9jdW1lbnQuZ2V0RWxlbWVudEJ5SWQoInByb2dyYW1z
TGlzdCIpOwoJCWxldCB0cGwgPSBkb2N1bWVudC5nZXRFbGVtZW50QnlJZCgicHJvZ3JhbVRlbXBs
YXRlIik7CgkJbGV0IG5ld05vZGUgPSBkb2N1bWVudC5pbXBvcnROb2RlKHRwbC5jb250ZW50LCB0
cnVlKTsKCQluZXdOb2RlLmNoaWxkcmVuWzBdLmNoaWxkcmVuWzFdLm9uY2xpY2sgPSByZW1vdmVQ
cm9ncmFtOwoJCXByb2dyYW1zTGlzdC5hcHBlbmRDaGlsZChuZXdOb2RlKTsKCX0KCWZ1bmN0aW9u
IHJlbW92ZVByb2dyYW0oZSkKCXsKCQlsZXQgcHJvZ3JhbXNMaXN0ID0gZG9jdW1lbnQuZ2V0RWxl
bWVudEJ5SWQoInByb2dyYW1zTGlzdCIpOwoJCWxldCBsaSA9IGUudGFyZ2V0LnBhcmVudEVsZW1l
bnQ7CgkJcHJvZ3JhbXNMaXN0LnJlbW92ZUNoaWxkKGxpKTsKCX0KCWZ1bmN0aW9uIHNpbXVsYXRl
KCkKCXsKCQlsZXQgcHJvZ3JhbXNMaXN0ID0gZG9jdW1lbnQuZ2V0RWxlbWVudEJ5SWQoInByb2dy
YW1zTGlzdCIpOwoJCWxldCBwcm9ncmFtcyA9IFtdOwoJCWxldCBuID0gcHJvZ3JhbXNMaXN0LmNo
aWxkcmVuLmxlbmd0aDsKCQlmb3IobGV0IGkgPSAwOyBpIDwgbjsgaSsrKQoJCXsKCQkJbGV0IGxp
ID0gcHJvZ3JhbXNMaXN0LmNoaWxkcmVuW2ldOwoJCQlsZXQgbmFtZSA9IGxpLmNoaWxkcmVuWzBd
LnZhbHVlOwoJCQlsZXQgc3JjID0gbGkuY2hpbGRyZW5bM10udmFsdWU7CgkJCXByb2dyYW1zW2ld
ID0ge25hbWU6IG5hbWUsIHNyYzogc3JjLCBzY29yZTogMH07CgkJfQoJCWxldCByZXN1bHRzTGlz
dCA9IGRvY3VtZW50LmdldEVsZW1lbnRCeUlkKCJyZXN1bHRzTGlzdCIpOwoJCXJlc3VsdHNMaXN0
LmlubmVySFRNTCA9ICcnOwoJCWZvcihsZXQgaSA9IDA7IGkgPCBuOyBpKyspCgkJewoJCQlsZXQg
bGkgPSBkb2N1bWVudC5jcmVhdGVFbGVtZW50KCJsaSIpOwoJCQlsaS5pbm5lckhUTUwgPSBgJHtw
cm9ncmFtc1tpXS5uYW1lfTogJHtwcm9ncmFtc1tpXS5zY29yZX1gOwoJCQlyZXN1bHRzTGlzdC5h
cHBlbmRDaGlsZChsaSk7CgkJfQoJCWZvcihsZXQgY21waSA9IDA7IGNtcGkgPCBuOyBjbXBpKysp
CgkJewoJCQlsZXQgY21wID0gZXZhbChwcm9ncmFtc1tjbXBpXS5zcmMpOwoJCQlmb3IobGV0IHAx
aSA9IDA7IHAxaSA8IG47IHAxaSsrKQoJCQlmb3IobGV0IHAyaSA9IHAxaSArIDE7IHAyaSA8IG47
IHAyaSsrKQoJCQl7CgkJCQlpZihwMWkgPT0gY21waSB8fCBwMmkgPT0gY21waSkgY29udGludWU7
CgkJCQlsZXQgcDEgPSBwcm9ncmFtc1twMWldLCBwMiA9IHByb2dyYW1zW3AyaV07CgkJCQlsZXQg
cmVzdWx0ID0gY21wKHAxLnNyYywgcDIuc3JjKTsKCQkJCWlmKHJlc3VsdCA9PT0gMSkKCQkJCQlw
MS5zY29yZSsrOwoJCQkJZWxzZSBpZihyZXN1bHQgPT09IDIpCgkJCQkJcDIuc2NvcmUrKzsKCQkJ
CWVsc2UgYWxlcnQoYHByb2dyYW0gJHtwcm9ncmFtc1tjbXBpXS5uYW1lfSByZXR1cm5lZCBpbnZh
bGlkIHJlc3VsdGApOwoJCQl9CgkJCWZvcihsZXQgaSA9IDA7IGkgPCBuOyBpKyspCgkJCQlyZXN1
bHRzTGlzdC5jaGlsZHJlbltpXS5pbm5lckhUTUwgPSBgJHtwcm9ncmFtc1tpXS5uYW1lfTogJHtw
cm9ncmFtc1tpXS5zY29yZX1gOwoJCX0KCX0KPC9zY3JpcHQ+Cjx0ZW1wbGF0ZSBpZD0icHJvZ3Jh
bVRlbXBsYXRlIj4KCTxsaT4KCQk8aW5wdXQgdHlwZT10ZXh0IHBsYWNlaG9sZGVyPSJuYW1lIi8+
CgkJPGlucHV0IHR5cGU9ImJ1dHRvbiIgdmFsdWU9InJlbW92ZSBwcm9ncmFtIj4KCQk8YnI+CgkJ
PHRleHRhcmVhIHBsYWNlaG9sZGVyPSJzb3VyY2UgY29kZSI+PC90ZXh0YXJlYT4KCTwvbGk+Cjwv
dGVtcGxhdGU+CjxzdHlsZT4KCS5jb2x1bW4geyBmbG9hdDogbGVmdDsgd2lkdGg6NTAlOyB9Cjwv
c3R5bGU+CjwvYm9keT4KPGhlYWQ+CjxkaXY+Cgk8ZGl2IGNsYXNzPSJjb2x1bW4iPgoJCTxpbnB1
dCB0eXBlPSJidXR0b24iIHZhbHVlPSJBZGQgcHJvZ3JhbSIgb25jbGljaz0iYWRkUHJvZ3JhbSgp
Ii8+CgkJPHVsIGlkPSJwcm9ncmFtc0xpc3QiPiA8L3VsPgoJPC9kaXY+Cgk8ZGl2IGNsYXNzPSJj
b2x1bW4iPgoJCTxpbnB1dCB0eXBlPSJidXR0b24iIHZhbHVlPSJSdW4gdGhlIGNvbXBldGl0aW9u
IiBvbmNsaWNrPSJzaW11bGF0ZSgpIi8+CgkJPGJyPgoJCUxhc3QgcnVuIHJlc3VsdHM6CgkJPGJy
PgoJCTx1bCBpZD0icmVzdWx0c0xpc3QiPiA8L3VsPgoJPC9kaXY+CjwvZGl2Pgo8L2hlYWQ+Cjwv
aHRtbD4K`.split("\n").join``))This is tagged king-of-the-hill. Whoever wins the most wins!
After posting this, I will post two example (community wiki) answers: one that compares in lexicographic order, and another that compares first by byte count, then in lexicographic order (the reason for posting two is that at least 3 programs are needed for anyone to get any points).
Sandbox stuff
- How can I prevent the last answer from always winning?
- Will that happen automatically, once enough answers are posted that it's nearly impossible to optimize for all of them?
- Would it be a good idea to introduce other requirements for the submissions, such as transitivity?
- Would it be a good idea to introduce a per-user submission limit (probably 1 or 2)?
