Not a bad idea but since there's no penalty for long strings I can win pretty much instantly by treating it as a typing test and typing a short (probably-unique) substring from each match separated by |. It'll get me an instant-win but if for some reason it matches some non-matches I make it a little longer. Here's a screen grab of me winning with this super-strategy. on this run for some reason you'll notice there's a bug at the end but normally it just lets me win with no chance for the other person to score. I'm not sure how you could address this... If you keep it this way it just becomes a typing test...
but I didn't "cheat" - I literally typed by hand a regex for the matches but not the non-matches. (Exactly as was asked.) I guess a way to fix this would be to make it like "regex golf" where there is a fixed time but the shortest overall regex wins... It could also be defeated if most substrings of each match were also in the things to avoid. For example if you're supposed to match cat but avoid catch then my strategy would be defeated. I would have to addd ^cat$ -- which wouuld cost me time and characters. :)
Not a bad idea but since there's no penalty for long strings I can win pretty much instantly by treating it as a typing test and typing a short (probably-unique) substring from each match separated by |. It'll get me an instant-win but if for some reason it matches some non-matches I make it a little longer. Here's a screen grab of me winning with this super-strategy. on this run for some reason you'll notice there's a bug at the end but normally it just lets me win with no chance for the other person to score. I'm not sure how you could address this... If you keep it this way it just becomes a typing test...
http://tinypic.com/player.php?v=jf88pe%3E&s=9