

Cuckoo Chess
This is an adaptation of Peter Österlund's CuckooChess 1.12, see official page.
The source code provided is a Java Maven project in UTF-8.
The program, except for the chess font, is copyrighted by Peter Österlund, and is available as open source under the GNU GPL v3 license.
About the program
Most of the ideas in the program are from the Chess Programming Wiki or from the TalkChess.com forum.
The program implements many of the standard methods for computer chess programs, such as iterative deepening, negascout, aspiration windows, quiescence search with SEE pruning and MVV/LVA move ordering, hash table, history heuristic, recursive null moves, futility pruning, late move reductions, opening book and magic bitboards.
The program is rather slow compared to state of the art chess programs. However, it is still quite good at tactics and scores of 300 on the tactical test suite, at 10 seconds thinking time per position, using an Intel Core i7 870 CPU. The only position not solved is the extremely complicated position 230, which according to , seems like a draw and therefore an invalid test position.