We analyze the puzzle video game This Game Is Not Going To Load Itself, where the player routes data packets of three different colors from given sources to given sinks of the correct color. Given the sources, sinks, and some previously placed arrow tiles, we prove that the game is in Sigma_2^P; in NP for sources of equal period; NP-complete for three colors and six equal-period sources with player input; and even without player input, simulating the game is both NP- and coNP-hard for two colors and many sources with different periods. On the other hand, we characterize which locations for three data sinks admit a perfect placement of arrow tiles that guarantee correct routing no matter the placement of the data sources, effectively solving most instances of the game as it is normally played.

翻译：我们分析益智视频游戏《这个游戏不会自己加载自己》，其中玩家需将三种不同颜色的数据包从指定起点路由至对应颜色的指定终点。给定起点、终点及部分已放置的箭头瓷砖，我们证明该游戏属于Sigma_2^P复杂度类；当所有起点周期相同时属于NP；对于三种颜色及六个等周期起点（含玩家输入）的情况为NP完全；即使无玩家输入，对于两种颜色及多个不同周期起点的情况，模拟该游戏兼具NP难与coNP难。另一方面，我们刻画了三个数据终点在何种位置允许完美放置箭头瓷砖，从而无论数据起点如何分布都能保证正确路由，这实际上解决了该游戏在常规玩法下的大部分实例。