Predicting one of 2 characters you will randomly press

[sctb]

Recent discussion: https://news.ycombinator.com/item?id=11824164

[throwaway2016a]

For me it is pretty consistently 50% +/- 5 even after a minute. It doesn't seem to work well if you repeat the same key a lot (i.e don't flip to often).

[overlordalex]

This is actually due to a psychological thing where humans don't find long strings of repeated letters/digits "random" and hence will flip more frequently than you'd expect from a machine.

I also recall there being a problem in the use of 5-grams which lead to a sequence in which it guessed 0%, but I'm struggling to find it now.

[widforss]

This is definetly not working. I'm certain that one can write a program like this, but I'm consistenly getting 50 % even though I use different strategies every time.

[oneeyedpigeon]

I got 52% after a good lot of keypresses (not sure exactly how many). I chose to not look at the screen at all during that time - I think that probably helps.

[andrezsanchez]

I did something like this a long time ago in a little competition for beating others' rock paper scissors programs, except I used the other players' moves relative to my own (e.g. my program could catch on to the other player choosing the move that would beat my last move) as well as their current pattern of winning or losing.

[vorotato]

It works if you're trying to be random, however if you're trying to react and respond to its patterns you can win.

[rohanprabhu]

So, I tried a simple python one-liner:

[os.urandom(1)[0] < 128 for x in xrange(0, 100)]

and typed 'd' for True and 'f' for False in the array, bringing the accuracy of the predictor down to 53%. Theoretically, I'm guessing doing it for large enough numbers should make it exactly 50%.

[mikeash]

If it doesn't come down to 50% for sufficiently large numbers, you've found a break in your OS's urandom and someone is about to be famous!

[dzdt]

Doesn't work from my smartphone. Sounds like a fun challenge though, would like to try.

[pi-rat]

Seems like it's written using ES6 syntax, which many browsers can't handle yet. Safari stopped at a lambda ( () => ) here.

[amake]

I'm on OS X with Firefox 47.0.1 and it doesn't work for me either :(

[js8]

Is there, for a given k, an easy to remember sequence (easy to remember algorithm with little state) that has all the k-grams with the same frequency?

For k=1: 01 repeating

For k=2: 0011 repeating

For k=3: 00010111 repeating

[justinpombrio]

They're called De Bruijn sequences[1], and there's an algorithm for constructing them. I'm not sure how easy it is to run in your head, though.

[1] https://en.wikipedia.org/wiki/De_Bruijn_sequence#Algorithm

[WillKirkby]

probably relevant: https://en.wikipedia.org/wiki/De_Bruijn_sequence

edit: dangit, beaten to the punch.

[tokenizerrr]

Very cool. Am getting ~50% accuracy so I'm glad to see my free will is still intact!

[andrewclunn]

40%? Lame.