What have you done so far with it? What kind of algorithm or logic are you using?
We tried MinMaxing using a point system. He had the grid in an array, and we tried to assign points to moves based on whats near it. We kept having issues getting it to put the right priority on it. I had it working once, and it won almost straight through Tourney 1 and 2, but made some mistakes, so I tried to correct those, and broke it again. The biggest problem I see is that it kept playing on blocked rows. (Like, the enemy plays three, you block on end, and the next move it plays the square after the block), and no matter what rules we set up, it wouldnt listen to them. Never broke on them.
I can send you our most recent test algorithm with small explanations if you want.
Also. Things picked up :|
[08:22:08 AM] [2] We won that!
[08:21:41 AM] T[2] We moved to the next level.
[08:21:41 AM] [2] We won that!
[08:21:15 AM] [2] We won that!
[08:20:46 AM] [1] We won that!
[08:20:18 AM] [1] We won that!
[08:19:37 AM] T[1] We didnt win!. Lets try again
[08:18:16 AM] [1] We won that!
[08:17:46 AM] [1] We won that!
[08:17:18 AM] [1] We won that!
[08:16:49 AM] [1] We won that!
[08:16:20 AM] T[1] We moved to the next level.
[08:16:20 AM] [1] We won that!
[08:15:51 AM] [1] We won that!
[08:15:25 AM] [1] We won that!
[08:14:56 AM] [1] We won that!
[08:14:28 AM] [1] We won that!
[08:14:00 AM] T[1] We moved to the next level.
[08:14:00 AM] [1] We won that!
[08:13:31 AM] [1] We won that!
[08:12:59 AM] [1] We won that!
[08:12:30 AM] T[1] We didnt win!. Lets try again
[08:12:04 AM] [1] We won that!
[08:11:34 AM] T[1] We moved to the next level.
[08:11:34 AM] [1] We won that!
[08:11:04 AM] [1] We won that!
[08:10:33 AM] [1] We won that!