**@@ 25,11 25,20 @@ $ make test**
## Purpose
-Given an engine to a game played with two players on a 2 dimensional board
-(using a predetermined interface) that will use
-[MPI](http://condor.cc.ku.edu/~grobe/docs/intro-MPI-C.shtml) and some sort of
-tree search/ optimization algorithm (most likely
-[negamax](ihttps://en.wikipedia.org/wiki/Negamax)).
+Given an engine to a game played with two players on a 2 dimensional board, we
+will use [MPI](http://condor.cc.ku.edu/~grobe/docs/intro-MPI-C.shtml) and some
+sort of tree search/ optimization algorithm (most likely
+[negamax](ihttps://en.wikipedia.org/wiki/Negamax) with alpha beta pruning). To
+recursively search the game space, and return optimal moves, given a game state.
+
+For more information go, have a look at
+* [Game Trees](https://en.wikipedia.org/wiki/Game_tree).
+* [Mini-Max](https://en.wikipedia.org/wiki/Game_tree#Mini%E2%80%93max_game-tree_search).
+* [Alpha Beta Pruning](https://en.wikipedia.org/wiki/Alpha%E2%80%93beta_pruning).
+
+Thus, TGB Will link the engine at compile time, and the result is a binary
+which will find optimal moves for that given game using the above described
+methods.
## Engines