Sumplete is Hard, Even with Two Different Numbers

September 11, 2023 · The Ethereal · 🏛 arXiv.org

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Suthee Ruangwises arXiv ID 2309.07161 Category cs.CC: Computational Complexity Cross-listed cs.DS Citations 1 Venue arXiv.org Last Checked 2 months ago
Abstract
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 solvability of a given Sumplete puzzle is NP-complete, even if the grid contains only two different numbers.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Computational Complexity