Tournaments between computer programs: chess, draughts, checkers, Go, backgammon, and more
Description given in 2010:
Our engine has three part: makemove, evaluation and search. We use UCT algorithm on search part. The engine’s evaluation part is based on static evaluation for each situation. Our make move part is simple but it offer the point that the piece can go. We build a library for the beginning and ending. We also use parallel method. It means that our engine would run on cluster or the machine that has CPU more than one. All intellectual property rights to ensure that all the code.