{-WETT This is the 2nd version of the game tree that uses the minimax algorithm to find the best possible move. It will take too long. Corners have a value of +50, fields next to the corners have a value of -10 (if the corner is empty) and the other fields along the edges have a value of +5. The idea was taken from: http://jonnielsen.net/downloads/Reversi%20in%20Java.pdf -}