Conjectured applicability of the counter‑gadget framework to other video games

Demonstrate that the counter‑gadget framework introduced in this paper can be applied to other video games to prove RE‑hardness of the single‑player reachability problem, by constructing at least one of the specified counter gadgets (Inc‑Dec‑JZ, Inc‑JZDec, Inc‑DecNZ‑PZ, or Inc[a,b]‑DecNZ[c,d]‑PZ) within those games.

Background

The paper develops a theory of counter gadgets in the motion‑planning‑through‑gadgets framework and shows that several specific gadgets suffice to prove RE‑completeness of reachability. Using this framework, the authors establish undecidability for multiple Super Mario Bros. titles.

They explicitly conjecture that the same framework should extend beyond the games analyzed here, motivating further work to embed these gadgets in other video games and thereby prove comparable hardness results.