In this work, we study a triangular variant of the Lights Out game, proposed in the 2025 Capixaba Mathematics Olympiad. We present a combinatorial description of the game, formally characterize its operations, and introduce the notion of a quiet pattern, which determines which configurations admit a solution and how many solutions they possess. We then analyze the geometry of quiet patterns and describe the propagation mechanisms that generate patterns for larger board sizes. Finally, we model the problem using linear systems over the field Z2, obtaining a matrix associated with the game and a combinatorial criterion for its invertibility. This criterion shows that the game admits a solution for every configuration if and only if the number of coverings of the triangular board by 1 x 1 and 2 x 1 tiles is odd.