How does it Work?
It is a recursive definition that gives the best possible move for a given player.
Does this work for everything?
No! This algorithm only works for games that are purely stratigic, not involving chance. There is also the factor of how big the playing table is. Since this is a recursive definition, there is the issue of having a long process time. Since tic-tac-toe is relatively small, this is not an issue.
Only two players
This also has to be a game of two players, because the minimax algorithm utilizes only two players. The max player will always make the move with the greater value, and as you can guess the min player does the opposite. Below you can see how this works out.
