Ok. I've come off about a 2 month break from programming all together, and I'm going to try at making an effective Tic-Tac-Toe game first with just 2 players, then later on to AI using the minimax game tree... or if any others that would be good for this type of game. Now, could someone explain to me how this game tree would go about in code? I've read about it's theory and nodes... but I've never practiced linked lists or what not. So this is my first try at nodes, children... all that stuff. How would code logic go with the tree below?
http://upload.wikimedia.org/wikipedi...-game-tree.png
So far, I've learned the minimax tree uses a point system to determine the winner of the game. The max player, usually the human player, tries to get the points from the tree to a positive number? Then the min player, usually the computer, tries to get the overall point total to a negative number? Each node represents a certain number total in the game?
Any help would be appreciated...along with some code examples.
Thank you.
