Re^2: [OT] Perl / Computer Science Science Fair Projects

[kyle]

Will (x strategy) beat (y strategy) in (some game?)

For any of the AI projects, this can be "does the AI beat a random player"? Mostly, I think this wouldn't be too interesting (a checkers player with any brain ought to beat a random player every time), but I think tic-tac-toe might have an interesting result (the random player may win by chance once in a while).

[DrHyde]

I believe that in noughts and crosses you can guarantee not to lose (ie if you can't win you can force a draw), regardless of whether you play first or second.