Substantial refactoring to implement correct Naive, UCT Monte Carlo tree search methods.

Removed unnecessary distinction between policy and tree search (tree search is a special kind of policy).
Calculation of all valid moves / arbitrary sets of moves is now a seperate class, as it serves a different purpose than a policy.
Introduced regression error in AlphaBeta test.

test/net/woodyfolsom/msproj/ZobristHashGeneratorTest.java

@@ -0,0 +1,17 @@
+package net.woodyfolsom.msproj;
+
+import static org.junit.Assert.*;
+
+import net.woodyfolsom.msproj.ZobristHashGenerator;
+
+import org.junit.Test;
+
+public class ZobristHashGeneratorTest {
+
+	@Test
+	public void testConstructor5x5() {
+		ZobristHashGenerator zobHashGen = ZobristHashGenerator.getInstance(5);
+		assertNotNull(zobHashGen);
+	}
+
+}