• A "Greedy" Go player (can check the Java code). It uses a statical evaluation (heuristic) to choose his next move.
  
• A Min-Max based Go player (here is the Java code for the algorithm). It's the classical way to choose the optimal move when we have the game tree.
  
• The AlphaBeta Go player (see it's Java code here). Faster than Min-Max (it does not explore branches that are clearly worse than what was already explored) but the idea is the same.

Here you can find a Class Diagram for the main classes in my program's architecture (I am an UML fan!)

Download the whole applet source code

JHFJF

"Go" back to my page.