Playing Chess with Limited Look Ahead
- URL: http://arxiv.org/abs/2007.02130v1
- Date: Sat, 4 Jul 2020 16:02:43 GMT
- Title: Playing Chess with Limited Look Ahead
- Authors: Arman Maesumi
- Abstract summary: We train a deep neural network to serve as a static evaluation function.
We show that our static evaluation function has encoded some semblance of look ahead knowledge.
We show that, despite strict restrictions on look ahead depth, our engine recommends moves of equal strength in roughly $83%$ of our sample positions.
- Score: 0.0
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: We have seen numerous machine learning methods tackle the game of chess over
the years. However, one common element in these works is the necessity of a
finely optimized look ahead algorithm. The particular interest of this research
lies with creating a chess engine that is highly capable, but restricted in its
look ahead depth. We train a deep neural network to serve as a static
evaluation function, which is accompanied by a relatively simple look ahead
algorithm. We show that our static evaluation function has encoded some
semblance of look ahead knowledge, and is comparable to classical evaluation
functions. The strength of our chess engine is assessed by comparing its
proposed moves against those proposed by Stockfish. We show that, despite
strict restrictions on look ahead depth, our engine recommends moves of equal
strength in roughly $83\%$ of our sample positions.
Related papers
- Offline Imitation Learning Through Graph Search and Retrieval [57.57306578140857]
Imitation learning is a powerful machine learning algorithm for a robot to acquire manipulation skills.
We propose GSR, a simple yet effective algorithm that learns from suboptimal demonstrations through Graph Search and Retrieval.
GSR can achieve a 10% to 30% higher success rate and over 30% higher proficiency compared to baselines.
arXiv Detail & Related papers (2024-07-22T06:12:21Z) - 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) - Grandmaster-Level Chess Without Search [9.5790772976207]
We train a model with supervised learning on a dataset of 10 million chess games.
Our largest model reaches a Lichess blitz Elo of 2895 against humans.
A systematic investigation of model and dataset size shows that strong chess performance only arises at sufficient scale.
arXiv Detail & Related papers (2024-02-07T00:36:24Z) - 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) - Curiosity-Driven Reinforcement Learning based Low-Level Flight Control [95.42181254494287]
This work proposes an algorithm based on the drive of curiosity for autonomous learning to control by generating proper motor speeds from odometry data.
We ran tests using on-policy, off-policy, on-policy plus curiosity, and the proposed algorithm and visualized the effect of curiosity in evolving exploration patterns.
arXiv Detail & Related papers (2023-07-28T11:46:28Z) - The Value of Chess Squares [5.647533385886476]
Our model takes a triplet (Color, Piece, Square) as an input and calculates a value that measures the advantage/disadvantage of having this piece on this square.
Our methods build on recent advances in chess AI, and can accurately assess the worth of positions in a game of chess.
arXiv Detail & Related papers (2023-07-08T20:17:24Z) - Are AlphaZero-like Agents Robust to Adversarial Perturbations? [73.13944217915089]
AlphaZero (AZ) has demonstrated that neural-network-based Go AIs can surpass human performance by a large margin.
We ask whether adversarial states exist for Go AIs that may lead them to play surprisingly wrong actions.
We develop the first adversarial attack on Go AIs that can efficiently search for adversarial states by strategically reducing the search space.
arXiv Detail & Related papers (2022-11-07T18:43:25Z) - Memory Bounds for the Experts Problem [53.67419690563877]
Online learning with expert advice is a fundamental problem of sequential prediction.
The goal is to process predictions, and make a prediction with the minimum cost.
An algorithm is judged by how well it does compared to the best expert in the set.
arXiv Detail & Related papers (2022-04-21T01:22:18Z) - Double Coverage with Machine-Learned Advice [100.23487145400833]
We study the fundamental online $k$-server problem in a learning-augmented setting.
We show that our algorithm achieves for any k an almost optimal consistency-robustness tradeoff.
arXiv Detail & Related papers (2021-03-02T11:04:33Z) - 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) - 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)
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.