Algo/Code help for tictactoe ai

[dday9]

Does the logic now work as intended? If so, what don't you like?

If you play corners, or the same thing over and over again, then it takes the same path.

the integer values could be 0=empty, 1=X, 2=O

I didn't think about that, I'm going to change to storing values as an int array.

Select-Case statement to all those ElseIfs

I don't usually do select/case's, simply because I rarely find a use for them in my usual(non game programming) code. But I do see where it'd be easier.

By the way, what is the min/max algorithm?

You can find it on wiki here, but simplified; It's an algorithm for 2 player games where player2's the best move/play is based on the play of player1. Pretty much think of it as an if/then statement. If I click on button1 then is button2,3,4 ect. my best move? And if I do choose, say button2, then what are the possibilities after that? Or another good example is to think of it as a tree, as shown here: