Beefy Boxes and Bandwidth Generously Provided by pair Networks
Perl-Sensitive Sunglasses

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

by jhourcle (Prior)
on Sep 08, 2008 at 16:05 UTC ( #709802=note: print w/replies, xml ) Need Help??

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

I'm probably biased by my high school experiences with science fairs, and getting knocked out in the regionals by someone who just wrote software to make a picture move around on a computer screen. (which by the posing of their problem, should've been categorized as 'biology').

... but I'm of the opinion that a good science fair project uses the scientific method, and isn't just the 'can I build something?' type project. By that definition, consider what the question is that you're trying to answer, and what your hypothesis and null hypothesis might be:

  • Can a computer beat a teenage human player in (some game?)
  • Will (x strategy) beat (y strategy) in (some game?)
  • Can a computer distinguish between four authors (of some genre/time period/etc) using text analysis?
  • ...

And don't forget that you'll need to consider not just the time to write the program, but to conduct the experiment as well ... hopefully, at least 30 times per group, which might make my first phrasing of the game idea problematic.

update: fixed typos.

  • Comment on Re: [OT] Perl / Computer Science Science Fair Projects

Replies are listed 'Best First'.
Re^2: [OT] Perl / Computer Science Science Fair Projects
by kyle (Abbot) on Sep 08, 2008 at 17:03 UTC

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

      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?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://709802]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others romping around the Monastery: (3)
As of 2017-11-18 08:31 GMT
Find Nodes?
    Voting Booth?
    In order to be able to say "I know Perl", you must have:

    Results (277 votes). Check out past polls.