The chess engine Khianat is planned to be based on a simple Monte Carlo tree search algorithm with a reasonable search depth. This algorithm would work with an evaluation function that evulates the strength of a certain move for a given position. Currently, Khianat runs with a search algorithm of depth 1 that maximizes loses of the opponent. At the moment Khianat has an estimated Elo of 400.

The chessboard is generated by the Script from Chris Oakman (https://chessboardjs.com/index.html). The implementation of the chess rules is done by chess.js-0.12.1 from Jeff Hlywa (https://github.com/jhlywa/chess.js).

This is hopefully not the last version of Khianat and there are many improvemts yet to come. Feel free to check out the blog!