{-WETT

Implemented Min-Max Algorithm with a depth of 4
http://en.wikipedia.org/wiki/Minimax
   - White is maximizing player
   - Black is minimizing player
   - Depth is adjusted for the last 10 moves to full depth

Added a simple adjusted Disk-Square Calculation (see pointBoard) from
http://de.wikipedia.org/wiki/Computer-Othello
   - Always take corners if possible
   - Avoid squares next to the corner
   - Prefer edge squares

Took Data Structures (and only the structures!) from
https://github.com/geon/Othello-in-Haskell

Takes about 10 minutes to play a full game with same AI on my moderate hardware

-}