![]() ![]() The rating changes between the search depths will then be graphed, after a time. This might even the playing field for the weaker chess engines, because they will analyze more moves for each search depth than their competitors. several of the worst chess programs do not have good pruning, so they never reach the kind of search depths that others can. ![]() Out of curiosity, I shall include not only some of the world's top chess engines, but also some of the worst. ![]() I shall make them play enough games, hopefully, against enough opponents, that I shall obtain a semi-accurate ELO rating. each engine shall suddenly be made into 20 different engines - each one representing that engine at a specific search depth. To do this, I shall use the GUI Arena and a group of chess engines for testing. I've decided to embark on an interesting experiment - I shall set out to discover how much, exactly, the search depths of a chess engine affect its rating. ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. Archives
March 2023
Categories |