This is a fun silly game. You input 0s and 1s as random as possible.
Some algorithm tries to guess what you are going to input based on your patterns.<p>http://seed.ucsd.edu/~mindreader/<p>It is extremely hard to win without a thought strategy, almost impossible.<p>And if you want to test a sequence versus two or three word distribution this is a cool tool:<p>http://www.khanacademy.org/labs/explorations/frequency-stability
I just won with a score of 9, although I have no idea how I did it.<p>I'm curious how this works. I'm guessing that the underlying algorithm is predicting based on a number of different heuristics, measuring the success of each heuristic, and using the prediction from the most successful heuristic up to that point. This can be a successful strategy for a Rock Paper Scissors bot (see: <a href="http://stackoverflow.com/a/8827797/173292" rel="nofollow">http://stackoverflow.com/a/8827797/173292</a>)<p>If it's implementing that sort of algorithm under the hood then it isn't necessarily measuring true randomness, as there would certainly be deterministic patterns that could beat it. Anyone have the time to type in the binary representation of the fibonacci sequence?