 The sabotage game has been applied to a variety of scenarios, including learning (Gierasimczuk, Kurzen, &amp; Velázquez-Quesada 2009), and communication networks (Aucher, van Benthem, &amp; Grossi 2018). On finite graphs, the game is clearly determined, with the computational complexity of identifying who has a winning strategy being Pspace-complete (Löding &amp; Rohde 2003).