Find fastest optimal move

Implemented depth-based values to the minimax algorithm. Now, if two
equally-valued nodes are discovered at different depths, the node closer
to the root will be chosen. This will, for example, select faster
checkmate positions over slower ones.
Merge pull request #8 from bmitzel/faster_minimax

Find fastest optimal move