Machine Learning Algorithms to Predict Chess960 Result and Develop Opening Themes

• URL: http://arxiv.org/abs/2310.18938v1
• Date: Sun, 29 Oct 2023 08:54:26 GMT
• Title: Machine Learning Algorithms to Predict Chess960 Result and Develop Opening Themes
• Abstract summary: The study aims to predict the game outcome using machine learning techniques and develop an opening theme for each starting position. The methodology involves segregating raw data from.pgn files into usable formats and creating datasets comprising approximately 500 games for each starting position.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: This work focuses on the analysis of Chess 960, also known as Fischer Random Chess, a variant of traditional chess where the starting positions of the pieces are randomized. The study aims to predict the game outcome using machine learning techniques and develop an opening theme for each starting position. The first part of the analysis utilizes machine learning models to predict the game result based on certain moves in each position. The methodology involves segregating raw data from .pgn files into usable formats and creating datasets comprising approximately 500 games for each starting position. Three machine learning algorithms -- KNN Clustering, Random Forest, and Gradient Boosted Trees -- have been used to predict the game outcome. To establish an opening theme, the board is divided into five regions: center, white kingside, white queenside, black kingside, and black queenside. The data from games played by top engines in all 960 positions is used to track the movement of pieces in the opening. By analysing the change in the number of pieces in each region at specific moves, the report predicts the region towards which the game is developing. These models provide valuable insights into predicting game outcomes and understanding the opening theme in Chess 960.

Related papers

• Domain-Independent Game Abstraction using Word Embedding Techniques [62.94836578759359]
  We propose a domain-independent approach to game abstraction.<n>Treating each action as a word and gameplay data as a corpus, word vectors can be trained to represent each action as a real-valued vector.
  arXiv  Detail & Related papers  (2026-05-15T02:30:36Z)
• Predicting Human Chess Moves: An AI Assisted Analysis of Chess Games Using Skill-group Specific n-gram Language Models [0.0]
  The framework employs n-gram language models to capture move patterns characteristic of specific player skill levels.<n>We trained separate models using data from the open-source chess platform Lichess.<n>The framework can classify skill levels with an accuracy of up to 31.7% when utilizing early game information.
  arXiv  Detail & Related papers  (2025-12-01T17:02:07Z)
• Towards Piece-by-Piece Explanations for Chess Positions with SHAP [0.20305676256390937]
  We adapt SHAP (SHapley Additive exPlanations) to attribute a chess engines evaluation to specific pieces on the board.<n>By treating pieces as features and systematically ablating them, we compute additive, per-piece contributions that explain the engines output.<n>This method draws inspiration from classical chess pedagogy, where players assess positions by mentally removing pieces.
  arXiv  Detail & Related papers  (2025-10-26T09:07:21Z)
• Out-of-distribution Tests Reveal Compositionality in Chess Transformers [6.356179251855671]
  We train a 270M parameter chess Transformer and test it on out-of-distribution scenarios, designed to reveal failures of systematic generalization.<n>Our analysis shows that Transformers exhibit compositional generalization, as evidenced by strong rule extrapolation.<n>In a more challenging test, we evaluate the models on variants including Chess960 - a variant of chess where starting positions of pieces are randomized.
  arXiv  Detail & Related papers  (2025-10-23T17:51:28Z)
• Predicting User Perception of Move Brilliance in Chess [3.434553688053531]
  We show the first system for classifying chess moves as brilliant. The system achieves an accuracy of 79% (with 50% base-rate), a PPV of 83%, and an NPV of 75%. We show that a move is more likely to be predicted as brilliant, all things being equal, if a weaker engine considers it lower-quality.
  arXiv  Detail & Related papers  (2024-06-14T17:46:26Z)
• Learning to Play Chess from Textbooks (LEAP): a Corpus for Evaluating Chess Moves based on Sentiment Analysis [4.314956204483074]
  This paper examines chess textbooks as a new knowledge source for enabling machines to learn how to play chess. We developed the LEAP corpus, a first and new heterogeneous dataset with structured (chess move notations and board states) and unstructured data. We performed empirical experiments that assess the performance of various transformer-based baseline models for sentiment analysis.
  arXiv  Detail & Related papers  (2023-10-31T08:26:02Z)
• The Update-Equivalence Framework for Decision-Time Planning [78.44953498421854]
  We introduce an alternative framework for decision-time planning that is not based on solving subgames, but rather on update equivalence. We derive a provably sound search algorithm for fully cooperative games based on mirror descent and a search algorithm for adversarial games based on magnetic mirror descent.
  arXiv  Detail & Related papers  (2023-04-25T20:28:55Z)
• Streaming Algorithms for Learning with Experts: Deterministic Versus Robust [62.98860182111096]
  In the online learning with experts problem, an algorithm must make a prediction about an outcome on each of $T$ days (or times) The goal is to make a prediction with the minimum cost, specifically compared to the best expert in the set. We show a space lower bound of $widetildeOmegaleft(fracnMRTright)$ for any deterministic algorithm that achieves regret $R$ when the best expert makes $M$ mistakes.
  arXiv  Detail & Related papers  (2023-03-03T04:39:53Z)
• Physics Informed Shallow Machine Learning for Wind Speed Prediction [66.05661813632568]
  We analyze a massive dataset of wind measured from anemometers located at 10 m height in 32 locations in Italy. We train supervised learning algorithms using the past history of wind to predict its value at a future time. We find that the optimal design as well as its performance vary with the location.
  arXiv  Detail & Related papers  (2022-04-01T14:55:10Z)
• Logic-based AI for Interpretable Board Game Winner Prediction with Tsetlin Machine [23.83480738752374]
  We propose to use propositional logic expressions to describe winning and losing board game positions. We employ a Tsetlin Machine (TM) to learn these expressions from previously played games. On average, the TM testing accuracy is $92.1%$, outperforming all the other evaluated algorithms.
  arXiv  Detail & Related papers  (2022-03-08T20:10:25Z)
• No-Regret Learning in Time-Varying Zero-Sum Games [99.86860277006318]
  Learning from repeated play in a fixed zero-sum game is a classic problem in game theory and online learning. We develop a single parameter-free algorithm that simultaneously enjoys favorable guarantees under three performance measures. Our algorithm is based on a two-layer structure with a meta-algorithm learning over a group of black-box base-learners satisfying a certain property.
  arXiv  Detail & Related papers  (2022-01-30T06:10:04Z)
• Towards General Function Approximation in Zero-Sum Markov Games [126.58493169301012]
  This paper considers two-player zero-sum finite-horizon Markov games with simultaneous moves. Provably efficient algorithms for both decoupled and coordinated settings are developed.
  arXiv  Detail & Related papers  (2021-07-30T15:25:13Z)
• Determining Chess Game State From an Image [19.06796946564999]
  This paper puts forth a new dataset synthesised from a 3D model that is an order of magnitude larger than existing ones. A novel end-to-end chess recognition system is presented that combines traditional computer vision techniques with deep learning. The described system achieves an error rate of 0.23% per square on the test set, 28 times better than the current state of the art.
  arXiv  Detail & Related papers  (2021-04-30T13:02:13Z)
• LiveChess2FEN: a Framework for Classifying Chess Pieces based on CNNs [0.0]
  We have implemented a functional framework that automatically digitizes a chess position from an image in less than 1 second. We have analyzed different Convolutional Neural Networks for chess piece classification and how to map them efficiently on our embedded platform.
  arXiv  Detail & Related papers  (2020-12-12T16:48:40Z)
• Chess2vec: Learning Vector Representations for Chess [0.0]
  We generate and evaluate vector representations for chess pieces. We uncover the latent structure of chess pieces and moves, as well as predict chess moves from chess positions.
  arXiv  Detail & Related papers  (2020-11-02T14:50:48Z)
• Learning to Play Sequential Games versus Unknown Opponents [93.8672371143881]
  We consider a repeated sequential game between a learner, who plays first, and an opponent who responds to the chosen action. We propose a novel algorithm for the learner when playing against an adversarial sequence of opponents. Our results include algorithm's regret guarantees that depend on the regularity of the opponent's response.
  arXiv  Detail & Related papers  (2020-07-10T09:33:05Z)
• Smooth markets: A basic mechanism for organizing gradient-based learners [47.34060971879986]
  We introduce smooth markets (SM-games), a class of n-player games with pairwise zero sum interactions. SM-games codify a common design pattern in machine learning that includes (some) GANs, adversarial training, and other recent algorithms. We show that SM-games are amenable to analysis and optimization using first-order methods.
  arXiv  Detail & Related papers  (2020-01-14T09:19:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.