{-WETT
Originally, our idea was to build a game tree and then, using the minimax algorithm, we wanted to find the best possible move. 
Problem was that our implementation of the game tree was very badly done (aka very slow) and it took forever to create one even of depth 4,
so we stuck to the simplest implementation and created ... this. 
A teeny tiny bit of game theory is hidden in the method countFields that returns the value of all fields gained in one direction. 
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
Implemented in a team with Alexandra Fritzen.
-}