Chess Project for University by Yonathan Maalo.
The project will contain:
Bitboard - Board Representation
Magic Bitboards - For generating Attacks
Pseudo-Legal Move Generator- To generate moves, legality checked if the move is actually used.
Principal Variation Search - Search algorithm
MTD(f) - Alternative search algorithm for a second A.I.
Iterative Deepening - Enhancement to Alpha-Beta/MTD(f)
Null Move Pruning
Aspiration Windows
Transposition table - Lookup table of positions for MTD(f).
Zobrist hashing - For the transposition table, threefold repetition etc.