Graph-Guided Item Randomizers: Formal Models, Search Strategies, and Metrics for Procedural Game Worlds
This paper formulates key-item placement in adventure-style games as a reachability problem on directed graphs with rule-constrained edges, introducing formal algorithms that support progression feasibility while enabling controlled randomness. Three placement procedures are defined in this paper: Random Fill, Forward...