godah / reversi Goto Github PK

Copyright (C) Georgios Migdos , Filia Dova

This software was developed as an assignment for the "Artificial Intelligence" course at the Athens Univesity Of Economics And Business (Spring 2010).

Available under the MIT License

![Screenshot1][screenshot1] [screenshot1]: Reversi/raw/master/screenshots/screenshot_th.png "Screenshot of BMach running."

• Replace the vector instances with arraylist instances
• Change the integer constant members to enumerations
• Javadoc

public void apply(Node n, int maxDepth, SearchAlgorithm algorithm, Evaluator eval);

• n : An instance of a class extending the abstract class ai.Node .
• maxDepth: An integer defining the maximum depth of the search tree.
• algorithm: The algorithm (ai.MiniMax.SearchAlgorithm) to be used when searching the tree of states.
• eval: An instance of a class extending the abstract class ai.Evaluator. Evaluators return an integer value for the Node passed to their evaluate() method.