Extension to the m-eternal (all guards move) variant
Ascertain whether the algorithms and complexity results obtained for Fast-Strategy extend to the m-eternal domination variant in which the Defender may move more than one guard per turn, and characterize the minimal number of turns required for Attacker to win in this setting.
References
Besides Conjecture \ref{conj-pspace-hard-bipartite}, we enumerate some open questions for future work. Can our results be adapted in the “all guards move” variant of eternal domination (where Defender can move more than one guard at each turn)?
— Fast winning strategies for the attacker in eternal domination
(2401.10584 - Bagan et al., 19 Jan 2024) in Conclusion (Open questions)