Noughts and Crosses Challenge

A little more detail... This challenge probably ISN'T the best if you've just started out programming. If you're still getting to grips with the basics, then I'd recommend trying mik's breakout challenge that was posted a few weeks ago, or something similar to that. That said, the challenge here is all about creating and working out the algorithm to create a flawless naughts and crosses player, so you don't have to be a wizard at Java - even if you've come from another programming background and haven't been coding in Java that long, you might still be able to crack this one :) So where do you start? Apart from the obvious (downloading the source) you've got a class (AI) you can modify in any way you like - as long as you don't circumvent the rules and play unfairly! There are also 2 methods in the Grid class that you will need to use - the first one, move, is what you call to place a naught in a square. That's pretty essential to actually do anything! The second, getDescription(), returns a 3x3 array of strings, each representing a different cell and each containing a description of that cell. Apart from that, all the coding is down to you! You've got to first find out a method to win all the time (Google will help you with that - there's plenty of sites out there that explain how) and then you've got to convert that method into a Java algorithm. If a few people take this up, it'd be really interesting to see the differences in how you approached / solved the problem, so feel free to post solutions! Good luck!