scientific article; zbMATH DE number 5688296

MaRDI QIDQ3550085zbMATH OpenFDO

Authors Ryan Mullen

Publication date 30 March 2010

Full work available at URL https://eudml.org/doc/229530, http://www.emis.de/journals/JIS/VOL12/Mullen/mullen2.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

nonogramspaint by numbers puzzle

Mathematics Subject Classification ID

Combinatorial inequalities (05A20)

Recommendations

• The enumeration of standard puzzles
• Minimal and maximal Numbrix puzzles
• A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles
• Finding a unique solution to Radon-Kaczmarz puzzles
• The painted cube: extensions from a classic problem
• Enumerating solutions to grid-based puzzles with a fixed number of rows
• A characterization of achievable patterns of the MN-puzzle problem
• Computing solutions of the paintshop-necklace problem

Cited in

(6)

• Enumerating solutions to grid-based puzzles with a fixed number of rows
• Nonograms: combinatorial questions and algorithms
• scientific article; zbMATH DE number 6863896 (Why is no real title available?)
• The asymptotics of useless hint sequences in nonograms
• scientific article; zbMATH DE number 6161631 (Why is no real title available?)
• A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles

Describes a project that uses

Uses Software

• OEIS

This page was built for publication:

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