We show the undecidability of whether a team has a forced win in a number of well known video games including: Team Fortress 2, Super Smash Brothers: Brawl, and Mario Kart. To do so, we give a simplification of the Team Computation Game from Hearn and Demaine's “Games, Puzzles, and Computation” [7], and use that to give an undecidable abstract game on graphs. This graph game framework better captures the geometry and common constraints in many games and is thus a powerful tool for showing their computational complexity.

中文翻译：

---

在视频游戏方面合作？不可能！团队多人游戏的不确定性

我们展示了在一些著名的视频游戏中，包括团队要塞2，超级粉碎兄弟：争吵和马里奥·卡丁车，团队是否有强制胜利的不确定性。为此，我们从Hearn和Demaine的“游戏，难题和计算” [7]中简化了团队计算游戏，并使用它在图形上给出了不确定的抽象游戏。这种图形游戏框架可以更好地捕获许多游戏中的几何图形和常见约束，因此是展示其计算复杂性的强大工具。