arXiv:2607. 21195v1 Announce Type: cross Abstract: Chess is a two player strategic game that is embedded in classical AI culture as it was once the frontier for intelligent behaviour.
arXiv:2608.22795v1 Announce Type: new Abstract: The AI field has been rapidly developing, leading to the emergence of a large number of AI training datasets of various types. These datasets contain d...
arXiv:2606. 20210v1 Announce Type: new Abstract: Immersion in video games depends not only on graphics, audio, and game mechanics, but also on the quality of in-game characters.
The paper introduces a method for creating reactive character behaviors in continuous games as compact, human‑readable programs. It searches over a domain‑specific language that uses reactive geometric decisions and higher‑order constructs to discretize continuous behavior space, while eliminating redundant program forms through synthesis antipatterns. The approach, called agentic sketching, combines bottom‑up symbolic enumeration with top‑down guidance from a coding agent, and outperforms either technique alone on a benchmark of 14 continuous games.
Game Arena is an open, continuously expanding platform that evaluates large language models through competitive games, allowing head‑to‑head matchups in structured environments. Unlike static benchmarks, it prevents performance saturation by increasing gameplay difficulty as models improve. The report outlines the infrastructure and presents three pilot games—Chess, Poker, and Werewolf—covering perfect information, imperfect information, and multiplayer settings, and details evaluation metrics and competition results.
Self-Play Search Distillation (SPSD) is a framework that generates superhuman synthetic data by having MuZero-like networks play board games in executable environments. The search records are converted into structured reasoning chains that serve as environment‑grounded supervision for training large language models. When applied to Qwen3‑4B‑Base, SPSD improves performance on six mathematics benchmarks from 24.1 to 36.6 and raises the win rate on unseen games from 15% to 45%.
arXiv:2607. 12097v1 Announce Type: new Abstract: Video games are a dynamic medium experienced over time.
arXiv:2603. 20510v2 Announce Type: replace Abstract: Language models often lack grounded reasoning capabilities in specialized domains where training data is scarce but bespoke systems excel.
arXiv:2608. 12593v1 Announce Type: new Abstract: Discovery---formulating novel generalizations---is a central part of the scientific process.
The paper introduces a text-based, multi-agent version of the board game Clue to test multi-step deductive reasoning in large language models (LLMs). Six LLM-based agents (GPT‑4o‑mini and Gemini‑2.5‑Flash) play turn‑based games, and a tool‑augmented approach uses a structured possibility matrix to convert implicit game state into explicit remaining possibilities, thereby offloading memory and deductive constraints from the agents. The study compares this tool‑augmented method against a baseline to assess its impact on reasoning quality and task success in a strategic reasoning environment.
The paper introduces LUGL (Local Updates, Global Learning), a framework that separates data collection from model fitting, allowing non‑incremental learners such as gradient‑boosted trees (LightGBM) to be used in reinforcement learning for games. LUGL alternates between a local update phase—where agents play self‑play games and store tabular updates—and a global learning phase—where a function approximator is trained on the accumulated table before it is reset. Experiments on both perfect‑information and imperfect‑information games show that LightGBM‑based agents perform competitively or better than neural‑network baselines like DQN and DeepCFR.
The paper introduces Local Updates, Global Learning (LUGL), a framework that separates data collection from model training, allowing non‑incremental learners such as gradient‑boosted trees (LightGBM) to be used in reinforcement learning for games. LUGL alternates between a local phase—where self‑play generates tabular updates—and a global phase—where these updates train a function approximator before resetting the table. Experiments on both perfect‑information and imperfect‑information games show that LightGBM agents perform competitively or better than neural‑network baselines like DQN and DeepCFR.
arXiv:2608.29563v1 Announce Type: cross Abstract: School coaches prepare for opponents with game film and intuition. The analytics tools of professional teams stay out of reach. We ask how far public...