OpenBlock:自适应方块匹配游戏中的建设性与验证内容生成
摘要
本文介绍了OpenBlock,一种用于自适应方块匹配游戏中建设性与验证内容生成的方法,旨在通过验证来增强程序化生成。
arXiv:2609.22177v1 Announce Type: new
Abstract: Tile-matching puzzle games serve hundreds of millions of players, yet the content-generation algorithms that decide which pieces to present at each turn remain proprietary, and no open platform exists for studying adaptive difficulty in this genre. We present an adaptive tile-matching platform whose central algorithmic contribution is a dual-track content-generation architecture: a deterministic rule-based generator that is always available, and an optional learned generator, both subject to a common verification gate that establishes, by exhaustive sequential-placement search, that every delivered piece set is fully placeable so the learned track can never degrade the constructive-feasibility guarantee of the rule track. A self-play reinforcement-learning placement agent, supervised by auxiliary tasks that expose per-shape placeability to shared representations, is used to diagnose the game's dominant failure mode: at high board fill, long-bar pieces lose the majority of their legal placements. Across 234,000+ self-play episodes the agent reaches a 35.6\% win rate (median score 4,200), and controlled simulation shows that at board fill rates of 70--75\%, 33--56\% of long-bar pieces have no legal placement, while spawn difficulty distributions are statistically indistinguishable between won and lost games---evidence that board-state degeneration, not content difficulty, drives late-game failure. Head-to-head ablations show that per-shape placeability supervision---not aggregate difficulty features---drives the representation gain, and a 14-day online gray rollout (48,000 players; sample-ratio verified, CUPED-adjusted) lifts day-1 retention by 1.8 percentage points and session duration by 7\% over the rule track alone, quantifying the neural track's asymmetric upside in live play.
查看缓存全文
缓存时间: 2026/09/22 09:16
# OpenBlock: Constructive and Verified Content Generation for Adaptive Tile-Matching Games Source: [https://arxiv.org/abs/2609.22177](https://arxiv.org/abs/2609.22177) Bibliographic Tools ## Bibliographic and Citation Tools Bibliographic Explorer Toggle Code, Data, Media ## Code, Data and Media Associated with this Article Demos ## Demos Related Papers ## Recommenders and Search Tools IArxiv recommender toggle About arXivLabs ## 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**](https://info.arxiv.org/labs/index.html)\.
相似文章
CreativeGame:面向机制感知的创意游戏生成
CreativeGame 是一个多智能体系统,通过程序化奖励与谱系记忆,在版本迭代中显式规划、追踪并演化游戏机制,持续生成 HTML5 游戏。
达到最优:强化学习用于可证明最优的四边形块分解
本文提出了一种强化学习代理,用于生成平面区域的可证明最优四边形块分解,展示了在可用性和最优性方面优于现有工具如Gmsh的性能。
基于强化学习与可验证奖励的LLM生成式楼层平面设计
本文介绍了一种基于文本的生成式楼层平面设计方法,该方法通过强化学习与可验证奖励对大语言模型进行微调,以提高对拓扑和数值约束的遵循程度,与现有方法相比取得了显著改进。
验证器即课程:面向跨系列游戏生成的执行门控自蒸馏
本文提出执行门控自蒸馏(Execution-Gated Self-Distillation)方法,利用确定性的、不可欺骗的启动检查作为迭代自蒸馏的过滤器,在14B模型上实现了从自然语言描述生成可运行Godot游戏的显著改进。
Code2Games:让编码智能体实现游戏世界生成
Code2Games 是一个智能体框架,它协调多个编码智能体,根据自然语言的游戏意图构建一致的游戏世界,并通过执行引导的重建将其适配至 Unreal Engine 5,同时提出了用于评估游戏世界生成质量的 GameCode4D 基准测试。