Mobile: Tap any empty cell to place your mark. All nine cells are sized for easy finger targeting.
Challenge our AI in this classic game of strategy. You play as X and go first. The AI uses a minimax algorithm to make smart moves. Can you find a way to win or will you settle for a draw?
Click on any empty cell to place your X. The AI will respond with O. Get three in a row (horizontal, vertical, or diagonal) to win!
Tic Tac Toe vs AI pits you against a computer opponent powered by the minimax algorithm — the same fundamental decision-making approach used in professional chess engines. While tic-tac-toe may appear simple (a 3x3 grid, two symbols, first to get three in a row wins), it actually serves as a perfect introduction to game theory, strategic thinking, and artificial intelligence concepts. Our AI plays optimally — meaning it will never make a mistake. This creates a fascinating challenge: can you find the AI's weakness, or will you learn the art of forcing a draw through perfect defensive play? The game is both a playable entertainment experience and an educational demonstration of how computers 'think' about strategy games.
Tic-tac-toe (also known as Noughts and Crosses, Xs and Os) is one of the oldest known games, with ancient versions found scratched into Roman ruins dating to the 1st century BCE. The game appeared in Egypt as early as 1300 BCE in a slightly different form. Despite its age, the game remained popular precisely because of its elegant simplicity and quick resolution. In the context of computer science, tic-tac-toe holds special significance: it was one of the first games programmed on early computers. In 1952, Alexander Douglas created OXO (a tic-tac-toe game) for his doctoral thesis at Cambridge — widely considered one of the first video games ever made. The minimax algorithm our AI uses was formalized by John von Neumann in 1928 and later applied to game-playing programs.
Rules: You play as X, the AI plays as O. Click any empty cell to place your mark. The first player to align three marks horizontally, vertically, or diagonally wins. If all 9 cells are filled without a winner, the game is a draw. Strategy: You go first, giving you a slight positional advantage. The AI responds immediately after your move. New Game: After each game (win, loss, or draw), click the 'New Game' button to reset the board. Mobile: Tap any empty cell to place your mark. Cells are sized for comfortable touch interaction.
Take the Center: The center square (position 5) is the strongest opening move, controlling the most winning lines (4 possible three-in-a-rows pass through center vs only 3 through corners and 2 through edges). Fork Creation: A 'fork' is a position where you threaten to win in two different ways simultaneously. Since your opponent can only block one threat per turn, a fork guarantees a win. Creating forks is the key offensive strategy. Block Forks: If the AI has two marks forming a potential fork, you must immediately disrupt this setup. Corner Strategy: If center is taken, corners are the next strongest positions. They connect to 3 possible winning lines each. Against Perfect AI: Against our minimax AI, the best realistic outcome for the human player is a draw. The AI will never make a mistake, so focus on achieving consistent draws through defensive play. The educational value is in understanding WHY certain moves are optimal.
Tic-tac-toe has been extensively studied in game theory as a 'solved game' — a game where the optimal outcome for both players is known with certainty. With perfect play from both sides, every game ends in a draw. This makes it an ideal teaching tool for concepts like backward induction, decision trees, and Nash equilibrium. The minimax algorithm in our game evaluates all possible future game states (there are only 255,168 possible games in tic-tac-toe) to choose the move that maximizes the AI's worst-case outcome. Understanding this concept — planning by considering your opponent's best response — is the foundation of strategic thinking applicable to business negotiation, competitive strategy, and any adversarial situation.
The AI in Tic Tac Toe uses the minimax algorithm — the same decision-making approach behind chess engines, just applied to a tiny 9-square board. It recursively evaluates every possible future game state and picks the move that guarantees the best worst-case outcome. Because tic-tac-toe is a 'solved' game, this means my AI literally cannot lose — the best you can do is force a draw. Writing the recursion was a fun weekend puzzle. If you ever beat it, it's a bug and I'd genuinely want to hear about it.