- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper presents Layered Game Engine (LGE), an architecture that represents game behavior through executable rules with explicit stages, scopes, and dependencies. A compiled dependency graph determines execution order, while an observation-driven planner selects spatially relevant entities and a dependency-closed set of rules. A VisualField abstraction separates semantic state from visual processing. The authors describe a C++20 prototype and evaluate full, selective, and cached-selective execution on synthetic worlds. At 100K entities, cached-selective execution reduces runtime from approximately 33.50 to 7.61 ms/tick, although its cost still increases substantially with total world population.
Critical strengths
-
The architecture separates several concerns clearly. Distinguishing execution stage, semantic scope, spatial organization, and rule dependencies provides a coherent framework for observation-driven execution. Sharing state representations and rule bodies between full and selective execution is a useful design choice: it allows execution selection to change without maintaining separate implementations of the underlying behaviors.
-
The empirical conclusions are appropriately restrained. The paper explicitly recognizes that a fixed semantic active set does not produce population-independent execution cost. It also acknowledges the limitations of the cross-engine workloads and avoids treating their timings as evidence of general performance superiority. This makes the reported scaling limitation a useful observation about the prototype.
Critical weaknesses
-
The architectural novelty relative to existing ECS scheduling mechanisms is insufficiently established. Sections 2.4 and 10.2 emphasize explicit stages, dependencies, and a compiled execution graph as distinguishing features. However, existing systems such as Bevy already expose explicit scheduling metadata and dependency graphs; see the Bevy ScheduleGraph documentation. The potentially distinctive contribution, therefore, appears to be the integration of observation-driven spatial selection with dependency closure. The paper does not explain precisely what this integration enables beyond an ECS scheduler combined with spatial queries. A concrete comparison or worked example would be important for establishing the contribution’s significance.
-
The evidence is too preliminary to establish the value of the proposed composition and selection mechanisms. The main quantitative result relies on cached selective execution, but the manuscript does not define what is cached, when it is refreshed, or whether cache construction and maintenance are included in the timings. The benchmark also leaves the seven active rules and their actual computational workload unspecified. Consequently, the reported speedup is difficult to attribute to particular architectural choices. Meanwhile, compositionality is supported mainly by brief descriptions of shared mechanisms, such as water and jelly-like behavior using the same primitive. Without a worked rule definition, dependency graph, and resulting execution plan, these examples provide limited evidence of the benefits of the proposed architecture. The authors acknowledge several limitations, but the remaining evidence does not yet establish a sufficiently substantial research contribution.
Questions for authors
-
What specific capability does LGE provide beyond an existing ECS with explicit scheduling dependencies and spatial queries? Could you demonstrate this through one concrete example showing how changing the observation or composing behaviors changes execution without modifying the rule bodies?
-
What exactly does cached selective cache, and what triggers an update? During the 120-tick benchmark, do the observation, region membership, or active entities change? Please specify the seven rules, the work they perform, and which planning and maintenance operations are included in the reported timings.
-
What behavior is intended for inactive entities and interactions across the selected spatial boundary? Section 2.3 appropriately avoids claiming general equivalence to full execution, but a concrete example explaining the implemented semantics would help establish when selective execution is useful.
Thank You
Thank you for the detailed review. I particularly appreciated your engagement with the architecture and the specific questions you raised.
Your observation that the integration of observation-driven spatial selection with dependency closure may be the more distinctive aspect of LGE was especially useful. I also found your questions concerning cache construction and maintenance, execution semantics across spatial boundaries, and concrete demonstrations of compositionality valuable.
These are precisely the kinds of questions I was hoping to obtain feedback on when submitting this early exploration. They helped me better understand which aspects of the architecture require stronger foundations and where its potential contribution might actually lie.
Since submission, my thinking has evolved considerably, and I am now investigating a substantially different formulation. I do not believe the current manuscript adequately represents that direction, so I have decided to withdraw it rather than continue with a rebuttal.
I sincerely appreciate the time you spent understanding the architecture and providing such specific feedback. I intend to carry these questions and perspectives forward into future work.