The fewest clues problem

DOI10.4230/LIPICS.FUN.2016.12MaRDI QIDQ5282810zbMATH OpenOpenAlexFDO

Authors Erik D. Demaine, Fermi Ma, Ariel Schvartzman, Erik Waingarten, Scott Aaronson

Publication date 17 July 2017

Full work available at URL https://dblp.uni-trier.de/db/conf/fun/fun2016.html#DemaineMSWA16

zbMATH Keywords

computational complexityhardness reductionspencil-and-paper puzzles

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Combinatorial games (91A46)

Recommendations

• The fewest clues problem
• There is no 16-clue sudoku: solving the sudoku minimum number of clues problem via hitting set enumeration
• Minimal number of clues for Sudokus
• The fewest clues problem of Picross 3D
• Computational complexity of NURIKABE

Cited in

(7)

• The fewest clues problem of Picross 3D
• Minimal number of clues for Sudokus
• The fewest clues problem
• On a complex KenKen problem
• Finding a unique solution to Radon-Kaczmarz puzzles
• On the PSPACE-completeness of Peg Duotaire and other peg-jumping games
• There is no 16-clue sudoku: solving the sudoku minimum number of clues problem via hitting set enumeration

This page was built for publication: The fewest clues problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5282810)