Sumplete is a logic puzzle famous for being developed by ChatGPT. The puzzle consists of a rectangular grid, with each cell containing a number. The player has to cross out some numbers such that the sum of uncrossed numbers in each row and column is equal to a given integer assigned to that row or column. In this paper, we prove that deciding a solvability of a given Sumplete puzzle is NP-complete, even if the grid contains only two different numbers.

翻译：Sumplete是一款因由ChatGPT开发而闻名的逻辑谜题。该谜题包含一个矩形网格，每个单元格内有一个数字。玩家需划掉部分数字，使得每行和每列中未被划掉的数字之和等于分配给该行或该列的给定整数。本文证明，判断给定Sumplete谜题是否可解是NP完全的，即便网格中仅包含两种不同的数字。