Chess\_db: A framework for working with large chess game datasets

• URL: http://arxiv.org/abs/2607.21195v1
• Date: Thu, 23 Jul 2026 11:17:41 GMT
• Title: Chess\_db: A framework for working with large chess game datasets
• Abstract summary: Chess is a two player strategic game that is embedded in classical AI culture.<n>Access to past games is also an essential part, both in knowing what games a specific player has played previously, and which continuations at a certain position have led to victory more often for each of the two colour players.<n>We present Chess_db a suite of logic programming tools that can effectively manipulate games both in memory and via creating back end databases.
• Score: 0.0
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Chess is a two player strategic game that is embedded in classical AI culture as it was once the frontier for intelligent behaviour. There was the silent assumption that the advent of computer engines that play better than the best humans will extinguish interest in the game. However, the opposite has come to pass, with a growing following for the game. A lot of the computational resources are now centered around training of players, where the engine output is just one aspect. Access to past games is also an essential part, both in knowing what games a specific player has played previously, and also which continuations at a certain position have led to victory more often for each of the two colour players. We present Chess_db a suite of logic programming tools that can effectively manipulate games both in memory and via creating back end databases. In particular, we provide versatile code that creates databases from PGN (portable game notation) game files and explore the suitability of open source key-value databases for storing position tables that provide near-instant access to information pertaining to substantially large number of games.

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)
• Outer-Learning Framework for Playing Multi-Player Trick-Taking Card Games: A Case Study in Skat [1.7006003864727406]
  In multi-player card games such as Skat or Bridge, the early stages of the game are often more critical to the success of the play than refined middle- and end-game play.<n>In this paper, we derive and evaluate a general bootstrapping outer-learning framework that improves prediction accuracy by expanding the database of human games with millions of self-playing AI games to generate and merge statistics.<n>We implement perfect feature hash functions to address compacted tables, producing a self-improving card game engine, where newly inferred knowledge is continuously improved during self-learning.
  arXiv  Detail & Related papers  (2025-12-17T13:27:44Z)
• General search techniques without common knowledge for imperfect-information games, and application to superhuman Fog of War chess [68.20244032271847]
  We present Obscuro, the first superhuman AI for Fog of War chess.<n>It introduces advances to search in imperfect-information games, enabling strong, scalable reasoning.<n>Experiments against the prior state-of-the-art AI and human players show that Obscuro is significantly stronger.
  arXiv  Detail & Related papers  (2025-06-02T01:41:27Z)
• Instruction-Driven Game Engine: A Poker Case Study [53.689520884467065]
  The IDGE project aims to democratize game development by enabling a large language model to follow free-form game descriptions and generate game-play processes. We train the IDGE in a curriculum manner that progressively increases its exposure to complex scenarios. Our initial progress lies in developing an IDGE for Poker, which not only supports a wide range of poker variants but also allows for highly individualized new poker games through natural language inputs.
  arXiv  Detail & Related papers  (2024-10-17T11:16:27Z)
• Machine Learning Algorithms to Predict Chess960 Result and Develop Opening Themes [0.0]
  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.
  arXiv  Detail & Related papers  (2023-10-29T08:54:26Z)
• FIREBALL: A Dataset of Dungeons and Dragons Actual-Play with Structured Game State Information [75.201485544517]
  We present FIREBALL, a large dataset containing nearly 25,000 unique sessions from real D&D gameplay on Discord with true game state info. We demonstrate that FIREBALL can improve natural language generation (NLG) by using Avrae state information.
  arXiv  Detail & Related papers  (2023-05-02T15:36:10Z)
• 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)
• On the complexity of Dark Chinese Chess [5.019685897194575]
  Dark Chinese chess combines some of the most complicated aspects of board and card games. This paper provides a complexity analysis for the game of dark Chinese chess.
  arXiv  Detail & Related papers  (2021-12-06T13:08:53Z)
• 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)
• Suphx: Mastering Mahjong with Deep Reinforcement Learning [114.68233321904623]
  We design an AI for Mahjong, named Suphx, based on deep reinforcement learning with some newly introduced techniques. Suphx has demonstrated stronger performance than most top human players in terms of stable rank. This is the first time that a computer program outperforms most top human players in Mahjong.
  arXiv  Detail & Related papers  (2020-03-30T16:18:16Z)

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.