Sumplete is Hard, Even with Two Different Numbers
Fuente:
arXiv
Gespeichert in:
| 1. Verfasser: | |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2023
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866914851100557312 |
|---|---|
| author | Ruangwises, Suthee |
| author_facet | Ruangwises, Suthee |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2309_07161 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Sumplete is Hard, Even with Two Different Numbers Ruangwises, Suthee Computational Complexity Data Structures and Algorithms 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. |
| title | Sumplete is Hard, Even with Two Different Numbers |
| topic | Computational Complexity Data Structures and Algorithms |
| url | https://arxiv.org/abs/2309.07161 |