Related papers: Nmbr9 as a Constraint Programming Challenge

Related papers

DiG-bench: Discovery in Games [46.68149875140523]
DiG-bench consists of a set of 70 independent games.<n>The levels of the game present a series of challenges to test whether the rules have been discovered.<n>All 70 games were solved by at least one human on first attempt.
arXiv Detail & Related papers (2026-08-12T21:06:06Z)
The Token Games: Evaluating Language Model Reasoning with Puzzle Duels [6.179868854898031]
We take inspiration from 16th-century mathematical duels to The Token Games (TTG): an evaluation framework where models challenge each other by creating puzzles.<n>Using results from pairwise duels, we then compute Elo ratings, allowing us to compare models relative to each other.<n>We evaluate 10 frontier models on TTG, and closely match the ranking from existing benchmarks such as Humanity's Last Exam, without involving any human effort in creating puzzles.
arXiv Detail & Related papers (2026-02-19T20:49:15Z)
HardcoreLogic: Challenging Large Reasoning Models with Long-tail Logic Puzzle Games [47.168515381473576]
Large Reasoning Models (LRMs) have demonstrated impressive performance on complex tasks, including logical puzzle games.<n>Existing corpora focus on popular puzzles like 9x9 Sudoku, risking overfitting to canonical formats and memorization of solution patterns.<n>We introduce HardcoreLogic, a challenging benchmark of over 5,000 puzzles across 10 games.
arXiv Detail & Related papers (2025-10-14T14:23:24Z)
ZeroSumEval: Scaling LLM Evaluation with Inter-Model Competition [14.753916893216129]
ZeroSumEval is a novel competition-based evaluation protocol that leverages zero-sum games to assess Large Language Models (LLMs) ZeroSumEval encompasses a diverse suite of games, including security challenges (PyJail), classic games (Chess, Liar's Dice, Poker), knowledge tests (MathQuiz), and persuasion challenges (Gandalf, Debate)
arXiv Detail & Related papers (2025-04-17T01:23:50Z)
Beyond Outcomes: Transparent Assessment of LLM Reasoning in Games [54.49589494014147]
GAMEBoT is a gaming arena designed for rigorous assessment of Large Language Models. We benchmark 17 prominent LLMs across eight games, encompassing various strategic abilities and game characteristics. Our results suggest that GAMEBoT presents a significant challenge, even when LLMs are provided with detailed CoT prompts.
arXiv Detail & Related papers (2024-12-18T08:32:53Z)
A QUBO Formulation for the Generalized LinkedIn Queens and Takuzu/Tango Game [49.1574468325115]
We present a QUBO formulation designed to solve a series of generalisations of the LinkedIn queens game. We adapt this formulation for several particular cases of the problem, as Tents & Trees. We also present two new types of problems, the Coloured Chess Piece Problem and the Max Chess Pieces Problem, with their corresponding QUBO formulations.
arXiv Detail & Related papers (2024-10-08T23:54:54Z)
A General Upper Bound for the Runtime of a Coevolutionary Algorithm on Impartial Combinatorial Games [1.104960878651584]
Coevolutionary algorithms (CoEAs) train game playing agents using self-play.<n>In this paper, we push the scope of runtime analysis for CoEAs to games, proving a general upper bound for the number of simulated games needed.<n>After proving the main result, we provide several applications to simple well-known games: Nim, Chomp, Silver Dollar, and Turning Turtles.
arXiv Detail & Related papers (2024-09-06T10:39:17Z)
People use fast, goal-directed simulation to reason about novel games [75.25089384921557]
We study how people reason about a range of simple but novel connect-n style board games. We ask people to judge how fair and how fun the games are from very little experience.
arXiv Detail & Related papers (2024-07-19T07:59:04Z)
Evolutionary Tabletop Game Design: A Case Study in the Risk Game [0.1474723404975345]
This work proposes an extension of the approach for tabletop games, evaluating the process by generating variants of Risk. We achieved this using a genetic algorithm to evolve the chosen parameters, as well as a rules-based agent to test the games. Results show the creation of new variations of the original game with smaller maps, resulting in shorter matches.
arXiv Detail & Related papers (2023-10-30T20:53:26Z)
On Grid Graph Reachability and Puzzle Games [0.0]
Many puzzle video games, like Sokoban, involve moving some agent in a maze. The difficulty of the game is mainly related to performing actions on objects, such as pushing (reachable) boxes. In this paper we study CP and SAT approaches for solving these kind of problems.
arXiv Detail & Related papers (2023-10-02T17:41:35Z)
Promptable Game Models: Text-Guided Game Simulation via Masked Diffusion Models [68.85478477006178]
We present a Promptable Game Model (PGM) for neural video game simulators. It allows a user to play the game by prompting it with high- and low-level action sequences. Most captivatingly, our PGM unlocks the director's mode, where the game is played by specifying goals for the agents in the form of a prompt. Our method significantly outperforms existing neural video game simulators in terms of rendering quality and unlocks applications beyond the capabilities of the current state of the art.
arXiv Detail & Related papers (2023-03-23T17:43:17Z)
Automated Graph Genetic Algorithm based Puzzle Validation for Faster Game Desig [69.02688684221265]
This paper presents an evolutionary algorithm, empowered by expert-knowledge informeds, for solving logical puzzles in video games efficiently. We discuss multiple variations of hybrid genetic approaches for constraint satisfaction problems that allow us to find a diverse set of near-optimal solutions for puzzles.
arXiv Detail & Related papers (2023-02-17T18:15:33Z)
An AlphaZero-Inspired Approach to Solving Search Problems [63.24965775030674]
We adapt the methods and techniques used in AlphaZero for solving search problems. We describe possible representations in terms of easy-instance solvers and self-reductions. We also describe a version of Monte Carlo tree search adapted for search problems.
arXiv Detail & Related papers (2022-07-02T23:39:45Z)
Statistical Modelling of Level Difficulty in Puzzle Games [0.0]
We formalise a model of level difficulty for puzzle games that goes beyond the classical probability of success. The model is fitted and evaluated on a dataset collected from the game Lily's Garden by Tactile Games.
arXiv Detail & Related papers (2021-07-05T13:47:28Z)
Generating Diverse and Competitive Play-Styles for Strategy Games [58.896302717975445]
We propose Portfolio Monte Carlo Tree Search with Progressive Unpruning for playing a turn-based strategy game (Tribes) We show how it can be parameterized so a quality-diversity algorithm (MAP-Elites) is used to achieve different play-styles while keeping a competitive level of play. Our results show that this algorithm is capable of achieving these goals even for an extensive collection of game levels beyond those used for training.
arXiv Detail & Related papers (2021-04-17T20:33:24Z)
TotalBotWar: A New Pseudo Real-time Multi-action Game Challenge and Competition for AI [62.997667081978825]
TotalBotWar is a new pseudo real-time multi-action challenge for game AI. The game is based on the popular TotalWar games series where players manage an army to defeat the opponent's one.
arXiv Detail & Related papers (2020-09-18T09:13:56Z)

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