AGENTIC-SYSTEMSJuly 15, 20261 min read

Representing and Generating Levels Over Time through Playtrace Reconstructive Partitioning

Researchers introduce a novel 'cake' representation and the Playtrace Reconstructive Partitioning (PRP) algorithm, allowing AI to generate game levels by encoding dynamic playtrace information over time. Tested on Sokoban, this approach outperforms existing PCG methods while preserving solution diversity.

Computer Science > Artificial Intelligence

Title:Representing and Generating Levels Over Time through Playtrace Reconstructive Partitioning

View PDF HTML (experimental)Abstract:Video games are a dynamic medium experienced over time. While there are many Procedural Content Generation (PCG) approaches for generating video game levels, they often use representations that abstract away this dynamic nature. In this paper, we introduce a novel, domain-independent ``cake'' representation for game levels over time which implicitly encodes dynamic information. We present a novel level generation approach Playtrace Reconstructive Partitioning (PRP) specifically developed for this cake representation. We compare against six state-of-the-art PCG approaches in the game domain of \textit{Sokoban}, and find that our approach can generate valid levels without sacrificing solution diversity. We believe our cake representation more neatly encodes the implicit dynamic nature of games compared to existing representations, which allows for our domain-agnostic level generation algorithm PRP.

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

Source: arXiv cs.AI Recent

More in this category

agentic-systems

Good Benchmarks

As AI models advance rapidly, establishing high-quality benchmarks is more critical than ever. A recent paper outlines the core criteria that define a truly effective and practical AI evaluation system.

agentic-systems

Cost-Governed RAG: Unified Per-Tenant Cost Attribution Across Retrieval and Generation in Multi-Tenant LLM Systems

Researchers have introduced Cost-Governed RAG, a novel architecture that enables precise, per-tenant cost attribution across both retrieval and generation layers in multi-tenant LLM systems. By leveraging a codebook-oblivious vector index called TurboVec, the system achieves 99.96% cost attribution accuracy while reducing infrastructure costs by up to 9 times.

agentic-systems

The Emerging Paradigm of Geospatial Foundation Models: From Pre-Training to Agentic Reasoning

This paper explores the paradigm shift enabled by Geospatial Foundation Models (GeoFMs), detailing their types, operationalization strategies, and the future of Agentic Geospatial Reasoning.

NOW LET US Related – Operationalising Multi-Dimensional Evaluation for Conversational Agents: A Scalable, Governed Pipeline with Selective Re-evaluation and Model Benchmarking

agentic-systems

Operationalising Multi-Dimensional Evaluation for Conversational Agents: A Scalable, Governed Pipeline with Selective Re-evaluation and Model Benchmarking

This paper presents GenAI Evaluation, a governed, configuration-driven pipeline designed for large-scale, multi-dimensional evaluation of retail conversational agents. The framework processes approximately 50,000 daily records, achieving high alignment with human judgment across key metrics like helpfulness, truthfulness, and tone.

agentic-systems

Connected by Construction: Learning Tractable Near-Tour Marginals for Traveling Salesman Problems

Researchers have introduced C2TSP, a breakthrough unsupervised learning pipeline for the Traveling Salesman Problem (TSP). By focusing on learning structurally meaningful latent objects rather than relying solely on the final decoding stage, C2TSP opens up new possibilities for AI-driven combinatorial optimization.

agentic-systems

Graph Feedback Controls Consensus and Clique Formation in Open-Weight Language-Model Populations

A new study reveals how the interaction graph topology among open-weight language models controls whether they reach global consensus or fragment into isolated cliques. Using a naming-game protocol on models up to 32B parameters, researchers demonstrate that bridge-seeking routing can successfully repair system fragmentation.