Solving general lattice puzzles

DOI10.1007/978-3-642-14553-7_14MaRDI QIDQ3587343zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Shahar Tal, Gill Barequet

Publication date 7 September 2010

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-14553-7_14

zbMATH Keywords

polycubespolyominoes

Mathematics Subject Classification ID

Polyominoes (05B50) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• A graph-theoretical approach to solving scramble squares puzzles
• Finding all solutions and instances of Numberlink and Slitherlink by ZDDs
• Sudoku: strategy versus structure
• AN ALGORITHM FOR COLOURING ADDITIVE PUZZLES
• A study of the Sudoku graph family

Cited in

(10)

• All solutions of the Soma cube puzzle
• Solving a binary puzzle
• Finding all solutions and instances of Numberlink and Slitherlink by ZDDs
• A graph-theoretical approach to solving scramble squares puzzles
• A case study on the graph-transformational modeling and analysis of puzzles
• Matchstick puzzles on a grid
• Implementing L'OZ
• A new mathematical model for tiling finite regions of the plane with polyominoes
• AN ALGORITHM FOR COLOURING ADDITIVE PUZZLES
• LIFTING PUZZLES IN DEGREE FOUR

This page was built for publication: Solving general lattice puzzles

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