Hi I am working on a online TIc-Tac-Toe game using the miniclip algorithm to calculate the best move.I found few examples but i really don't understand the miniclips logic.Some example would be great.
Thanks!
For a game with such a small number of possible states as Tic-Tac-Toe, it's quite feasible to just build a tree of all possible game states and have your AI only take branches that don't end in a loss.
Beyond that, I think what you're looking for is called minimax, and there's an article here that explains a variation of it in the context of Tic-Tac-Toe.
I guess Decision tree or more like game tree is what you're looking for