AI Chat AI Image Generator AI Video Text to Speech

Sumplete is Hard, Even with Two Different Numbers

09/11/2023

∙

by Suthee Ruangwises, et al.

∙

∙

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.

page 1

page 2

page 3

research

∙ 01/22/2021

Rikudo is NP-complete

Rikudo is a number-placement puzzle, where the player is asked to comple...

0 Viet-Ha Nguyen, et al. ∙

research

∙ 03/28/2021

StreamTable: An Area Proportional Visualization for Tables with Flowing Streams

Let M be an r× c table with each cell weighted by a nonzero positive num...

0 Jared Espenant, et al. ∙

research

∙ 06/26/2021

An Improved Physical ZKP for Nonogram

Nonogram is a logic puzzle consisting of a rectangular grid with an obje...

0 Suthee Ruangwises, et al. ∙

research

∙ 02/21/2019

A Note on Covering Young Diagrams with Applications to Local Dimension of Posets

We prove that in every cover of a Young diagram with 2kk steps with gene...

0 Stefan Felsner, et al. ∙

research

∙ 04/04/2022

A Performance Evaluation of Nomon: A Flexible Interface for Noisy Single-Switch Users

Some individuals with motor impairments communicate using a single switc...

0 Nicholas Bonaker, et al. ∙

research

∙ 03/03/2018

Path Puzzles: Discrete Tomography with a Path Constraint is Hard

We prove that path puzzles with complete row and column information--or ...

0 Jeffrey Bosboom, et al. ∙

research

∙ 01/10/2018

On Maximally Recoverable Codes for Product Topologies

Given a topology of local parity-check constraints, a maximally recovera...

0 D. Shivakrishna, et al. ∙