paper-with-me

Papers

Generating Creative Chess Puzzles

2025-10-27 · Xidong Feng, Vivek Veeriah, Marcus Chiam, Michael Dennis, Ryan Pachauri, Thomas Tumiel, Federico Barbero, Johan Obando-Ceron, Jiaxin Shi, Satinder Singh, Shaobo Hou, Nenad Tomašev, Tom Zahavy arxiv

While Generative AI rapidly advances in various domains, generating truly creative, aesthetic, and counter-intuitive outputs remains a challenge. This paper presents an approach to tackle these difficulties in the domain of chess puzzles. We start by benchmarking Generative AI architectures, and then introduce an RL framework with novel rewards based on chess engine search statistics to overcome some of those shortcomings. The rewards are designed to enhance a puzzle's uniqueness, counter-intuitiveness, diversity, and realism. Our RL approach dramatically increases counter-intuitive puzzle generation by 10x, from 0.22\% (supervised) to 2.5\%, surpassing existing dataset rates (2.1\%) and the best Lichess-trained model (0.4\%). Our puzzles meet novelty and diversity benchmarks, retain aesthetic themes, and are rated by human experts as more creative, enjoyable, and counter-intuitive than composed book puzzles, even approaching classic compositions. Our final outcome is a curated booklet of these AI-generated puzzles, which is acknowledged for creativity by three world-renowned experts.

📄 PDF Abstract BibTeX arXiv:2510.23881

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Diversifying AI: Towards Creative Chess with AlphaZero

2023-08-17 · Tom Zahavy, Vivek Veeriah, Shaobo Hou, Kevin Waugh 외

In recent years, Artificial Intelligence (AI) systems have surpassed human intelligence in a variety of computational tasks. However, AI systems, like humans, make mistakes, have blind spots, hallucinate, and struggle to…

Decision MakingDiversityGame of Chess

Evaluating In Silico Creativity: An Expert Review of AI Chess Compositions

2025-10-27 · Vivek Veeriah, Federico Barbero, Marcus Chiam, Xidong Feng 외 arxiv

The rapid advancement of Generative AI has raised significant questions regarding its ability to produce creative and novel outputs. Our recent work investigates this question within the domain of chess puzzles and prese…

Making New Connections: LLMs as Puzzle Generators for The New York Times' Connections Word Game

2024-07-15 · Tim Merino, Sam Earle, Ryan Sudhakaran, Shyam Sudhakaran 외

The Connections puzzle is a word association game published daily by The New York Times (NYT). In this game, players are asked to find groups of four words that are connected by a common theme. While solving a given Conn…

Understanding Reasoning from Pretraining to Post-Training

2026-07-17 · Jingyan Shen, Ang Li, Salman Rahman, Yifan Sun 외 arxiv

Reinforcement learning (RL) has become central to improving large language models (LLMs) on complex reasoning tasks, yet RL post-training is largely studied in isolation from the pretraining that precedes it. As a result…

Reinforcement Learning

Amortized Planning with Large-Scale Transformers: A Case Study on Chess

2024-02-07 · Anian Ruoss, Grégoire Delétang, Sourabh Medapati, Jordi Grau-Moya 외

This paper uses chess, a landmark planning problem in AI, to assess transformers' performance on a planning task where memorization is futile $\unicode{x2013}$ even at a large scale. To this end, we release ChessBench, a…

Memorization