ICGA Tournaments

This program is a negascout searcher and uses conventional techniques seen in chess programs such as transposition table, iterative deepening, null move pruning, selective extensions, late move reduction, futility pruning, and bitFile and bitRank that are seen in Chinese chess programs. The program uses a 13x14 board mapped into a 1D array, and will equip with an opening book built by the program. This program is original work done by the author.