Undecidability of Super Mario Wonder

Determine whether solving levels in Super Mario Wonder is undecidable by establishing RE‑completeness of the single‑player reachability problem under the same generalizations used in this paper (removing timer limits and allowing arbitrarily many enemies and on‑screen entities).

Background

The authors prove RE‑completeness for several 2D Mario games (New Super Mario Bros. series and Super Mario Maker styles) under standard generalizations allowing unlimited enemies and time. They note that Super Mario Wonder is the only recent 2D Mario game not covered by their results.

They highlight suggestive evidence in Wonder (events and infinitely spawning enemies) and pose the undecidability status of Wonder as a natural open question.