Kesh is a C++ chess engine with UCI . It searches the chess game tree using minimax algorithm and finds the best move according to a basic evaluation function . It uses alpha beta pruning , principal variation probing to reduce the search computation . It uses bitboards for move generation . The most challenging part was the move generation . Future improvements include opening database , NNUE and endgame database .

Built With

Share this project:

Updates