Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things
 
PerlMonks  

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

by DrHyde (Prior)
on Sep 09, 2008 at 09:34 UTC ( #710016=note: print w/ replies, xml ) Need Help??


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

There are two problems in Go that I would think might be appropriate (assuming that 9th grade == somewhere around about age 14).

The first, and the easiest to demonstrate because it's quickest, would be figuring out whether a move results in a group that is entirely surrounded and can be removed from the board.

The second, which builds on that, would be to implement a board on which two people can play, with the computer removing prisoners during play as above, but also spotting and not allowing other illegal moves such as suicide or repetition. Don't worry about the ruleset distinctions - just pick one and go with it.


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

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others avoiding work at the Monastery: (3)
As of 2014-07-10 06:25 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    When choosing user names for websites, I prefer to use:








    Results (200 votes), past polls