4 ms·
I counted up from 0 in binary (excluding leading zeroes) and even with a completely predictable series, it only did slightly better than 50%. I was expecting m
by smoyer 10y ago
I counted up from 0 in binary (excluding leading zeroes) and even with a completely predictable series, it only did slightly better than 50%. I was expecting more (that on-line game of 20 questions was freaky good).
- chki 10y agoWhich 20 questions game?
- IanCal 10y agoI'm guessing this: http://en.akinator.com/ http://en.akinator.com/
- vonmoltke 10y agoI have been having way too much fun with this, but it really goes off the rails sometimes. I am currently in a stream where the correct answer is "Ambrose Bunside". It asked me if my character has been dead for more than 100 years, then two questions later asked me if my character uses musical.ly. :/
- logfromblammo 10y agoIf the answers to both were yes, your character might have been a vampire, animate mummy, ghost, or lich.
- etjossem 10y agoI feel like it sometimes just wastes questions near the end when it's already narrowed the possibilities down. Maybe that's even on purpose, for showy effect. After all, it's pretty impressive when it appears to correctly get Frank Sinatra out of "does your character play video games for a living."
- rspeer 10y agoI'm guessing http://www.20q.net/ http://www.20q.net/, the original pretty impressive online 20 Questions game. (They were using the grating slogan "the neural net on the Internet" when neural nets were the pariah of AI. It's kind of amazing.)
- schoen 10y agoThe explanation of how it works says it uses 5-grams to predict the next bit, so if you use any sequence in which all 6-grams occur equally often, this won't be able to predict you at all. Actually, an interesting challenge might be to construct a sequence that gives the Oracle as low a score as possible (is there a nicer simpler way to describe this than simulating the Oracle's code and always choosing what it doesn't expect?).
- ikeboy 10y agoAlways choose the one that makes a new 6-gram, or that makes a 6-gram with the fewest previous appearances?
- schoen 10y agoSure, is there an easy way to generate that algorithmically without maintaining an explicit history? Is there a well-known sequence with that property? Do Gray codes have it, for example?
- ikeboy 10y agoYou'd want a sequence that contains every 6-gram exactly once and ends with the same 5 digits as it starts with: such a sequence would be 2^6=64+5=69 bits long, and then you'd repeat the first 64 over and over. (Or just contains exactly once up to cycles.) Some searching tells me this already has a name, see https://en.wikipedia.org/wiki/De_Bruijn_sequence https://en.wikipedia.org/wiki/De_Bruijn_sequence So yes, just take a De Bruijb sequence B(2,6) (algorithms in the link can generate them) and repeat it.
- schoen 10y agoNice!
- smoyer 10y agoYep ... Grays code was my immediate thought too.