Ве молиме користете го овој идентификатор да го цитирате или поврзете овој запис: http://hdl.handle.net/20.500.12188/27381
Наслов: Analysis and Comparison of Chess Algorithms
Authors: Trajkoska, Vesela
Dimeski, Gjorgji
Keywords: chess, genetic algorithm, Minimax, Monte Carlo, Stockfish, comparison
Issue Date: јул-2023
Publisher: Ss Cyril and Methodius University in Skopje, Faculty of Computer Science and Engineering, Republic of North Macedonia
Series/Report no.: CIIT 2023 papers;5;
Conference: 20th International Conference on Informatics and Information Technologies - CIIT 2023
Abstract: In this paper we analyze the results of three different algorithms programmed for playing chess – genetic algorithm, Monte Carlo, and Minimax. The algorithms are implemented in Python through 5 players that play chess against the Stockfish engine, each for 10 games, after which their Elo rating, game evaluation, game status, and time per move are compared. The results show that the algorithms cannot compare to an extensively trained and optimized chess engine such as Stockfish, and only 2 games of 50 total were won by the Minimax algorithm. There were no draws. The genetic algorithm is very fast, with less than a second needed for each move, while the other two are much slower, with times sometimes reaching over a minute. The Minimax algorithm’s speed decreases over time, while the Monte Carlo algorithms’ speeds increase over time.
URI: http://hdl.handle.net/20.500.12188/27381
Appears in Collections:Faculty of Computer Science and Engineering: Conference papers

Files in This Item:
File Опис SizeFormat 
CIIT2023_paper_5.pdf9.19 MBAdobe PDFView/Open
Прикажи целосна запис

Page view(s)

459
checked on 4.5.2025

Download(s)

491
checked on 4.5.2025

Google ScholarTM

Проверете


Записите во DSpace се заштитени со авторски права, со сите права задржани, освен ако не е поинаку наведено.