Nov 12, 2018 · About Tic Tac Toe; Minimax algorithm; Unbeatable Tic Tac Toe AI; Bonus; What’s next? Before we go into the AI part, let’s make sure that we understand the game. About Tic Tac Toe. Tic-tac-toe (also known as noughts and crosses or Xs and Os) is a paper-and-pencil game for two players, X and O, who take turns marking the spaces in a 3×3 grid ...

Aspen process explorer ad hoc calculationMy initial approach was to implement a simple MiniMax algorithm, and then to add alpha-beta pruning. However this is my current code: public int miniMax(char[] node, int playerNum) { int victor = checkWin(node); // returns 0 if game is ongoing, 1 for p1, 2 for p2, 3 for tie.

Minimax. Minimax is a classic algorithm for finding the best move in a two-player zero-sum game with perfect information like tic-tac-toe, checkers, or chess. It’s been extended and modified for other types of games as well.