Finished submission for tic-tac-toe.

I wrote this in Common Lisp as I didn't see a requirement it be done in a particular language. If necessary, I will try to rewrite it in another language.

The final product is 270 lines of Common Lisp, roughly a fourth of which are docstrings and comments.
I wound up going with Naive Negamax since I didn't know anything about search algorithms or game trees prior to this and didn't see any strict performance requirements. I found performance to be quite acceptable.

In particular, I naively tested SELECT-NEGAMAX and in the worst case (making the first move) on my system takes 1.036 seconds on average to complete. Calls after the first appear to take at most .10 to .13 seconds. Tests are an average of 6 calls (small sample size, I realize) on my 2GHz Core 2 Duo with some background processes running (music, web browser, etc).

If I make further changes unless requested by CMG they are not related to the submission.

Please let me know if anything further is required. Thanks.