{"title":"Chess Rating Estimation from Moves and Clock Times Using a CNN-LSTM","authors":"Michael Omori, Prasad Tadepalli","doi":"arxiv-2409.11506","DOIUrl":null,"url":null,"abstract":"Current rating systems update ratings incrementally and may not always\naccurately reflect a player's true strength at all times, especially for\nrapidly improving players or very rusty players. To overcome this, we explore a\nmethod to estimate player ratings directly from game moves and clock times. We\ncompiled a benchmark dataset from Lichess, encompassing various time controls\nand including move sequences and clock times. Our model architecture comprises\na CNN to learn positional features, which are then integrated with clock-time\ndata into a bidirectional LSTM, predicting player ratings after each move. The\nmodel achieved an MAE of 182 rating points in the test data. Additionally, we\napplied our model to the 2024 IEEE Big Data Cup Chess Puzzle Difficulty\nCompetition dataset, predicted puzzle ratings and achieved competitive results.\nThis model is the first to use no hand-crafted features to estimate chess\nratings and also the first to output a rating prediction for each move. Our\nmethod highlights the potential of using move-based rating estimation for\nenhancing rating systems and potentially other applications such as cheating\ndetection.","PeriodicalId":501301,"journal":{"name":"arXiv - CS - Machine Learning","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-09-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"arXiv - CS - Machine Learning","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/arxiv-2409.11506","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0
Abstract
Current rating systems update ratings incrementally and may not always
accurately reflect a player's true strength at all times, especially for
rapidly improving players or very rusty players. To overcome this, we explore a
method to estimate player ratings directly from game moves and clock times. We
compiled a benchmark dataset from Lichess, encompassing various time controls
and including move sequences and clock times. Our model architecture comprises
a CNN to learn positional features, which are then integrated with clock-time
data into a bidirectional LSTM, predicting player ratings after each move. The
model achieved an MAE of 182 rating points in the test data. Additionally, we
applied our model to the 2024 IEEE Big Data Cup Chess Puzzle Difficulty
Competition dataset, predicted puzzle ratings and achieved competitive results.
This model is the first to use no hand-crafted features to estimate chess
ratings and also the first to output a rating prediction for each move. Our
method highlights the potential of using move-based rating estimation for
enhancing rating systems and potentially other applications such as cheating
detection.