255,168 unique games of Tic Tac Toe to be played.
Here’s a document with every single game of Tic Tac Toe.This means that on the first move, the computer investigates the entire game tree – it considers every single possible Tic Tac Toe game and then choses randomly among the best (least dangerous) moves. The opponent’s strategy is calculated by way of the same algorithm, and so on. The algorithm works recursively by looking for the move that will let an optimally playing opponent inflict the least damage. This is a kind of meta-strategy that can be used for playing any game: Always chose the move that will minimize the maximum damage that your opponent can do to you. I was thinking about strategies and decided to implement a program that plays Tic Tac Toe according to John von Neumann’s minimax.
Tic Tac Toe (noughts and crosses) is always such a nice example.
0 kommentar(er)
