An efficient approach to TicTacToe AI?
Some time ago I made a little Tic Tac Toe game with my beginner knowledge just to practice my current skills. However, recently I decided to improve it and go for another approach on the AI part because the first version analyzed EVERY possible move with lots of if conditions (and that resulted in, like, a ~200 lines function)... Of course now I understand that was very inefficient and I searched for some ways on the site to remake it but only found raw data with no examples on stuff like the Minimax Tree, where all the possible moves were linked to each other. Can someone instruct me with examples or at least some info from where I can start reading and experimenting?