Beefy Boxes and Bandwidth Generously Provided by pair Networks
"be consistent"
 
PerlMonks  

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

by kyle (Abbot)
on Sep 08, 2008 at 17:03 UTC ( #709811=note: print w/ replies, xml ) Need Help??


in reply to Re: [OT] Perl / Computer Science Science Fair Projects
in thread [OT] Perl / Computer Science Science Fair Projects

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).


Comment on Re^2: [OT] Perl / Computer Science Science Fair Projects
Re^3: [OT] Perl / Computer Science Science Fair Projects
by DrHyde (Prior) on Sep 10, 2008 at 11:00 UTC
    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.

Log In?
Username:
Password:

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://709811]
help
Chatterbox?
and the web crawler heard nothing...

How do I use this? | Other CB clients
Other Users?
Others studying the Monastery: (7)
As of 2014-10-25 23:31 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    For retirement, I am banking on:










    Results (149 votes), past polls