BlitzKibitz is a C/C++ chess engine originally started as a university project and continues to be developed. BlitzKibitz doesn't have it's own interface but it is compatible with XBoard protocol. Implementation uses an Alpha-Beta pruning search-tree algorithm with transposition tables and opening tables built over magic bitboard data structures.

Currently there is no time management. The only limiting factor is the maximum depth the engine searches. For 15 min games it goes to about 6-7 plies, while for 5 min games we will build a binary that goes to 5-6 plies. We plan to change this to be time constrained.

The Amaterasu branch is an attempt to rewrite the project using almost the same ideas. Amaterasu is faster than BlitzKibitz, but the code is less "academic" and not tested as much. Main contributor for this branch is claudiu.bogdan.mihail.