Solving general lattice puzzles

Authors:
Gill Barequet;Shahar Tal
Affiliations:
Center for Graphics and Geometric Computing, Dept. of Computer Science, Technion--Israel Institute of Technology, Haifa, Israel;Dept. of Computer Science, The Open University, Raanana, Israel
Venue:
FAW'10 Proceedings of the 4th international conference on Frontiers in algorithmics
Year:
2010

Citing 5
Cited 0

Backtrack Programming

Journal of the ACM (JACM)
A program to solve the Pentomino problem by the recursive use of macros

Communications of the ACM
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Jigsaw Puzzles, Edge Matching, and Polyomino Packing: Connections and Complexity

Graphs and Combinatorics
Complexity of solvable cases of the decision problem for the predicate calculus

SFCS '78 Proceedings of the 19th Annual Symposium on Foundations of Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we describe implementations of two general methods for solving puzzles on any structured lattice. We define the puzzle as a graph induced by (finite portion of) the lattice, and apply a back-tracking method for iteratively find all solutions by identifying parts of the puzzle (or transformed versions of them) with subgraphs of the puzzle, such that the entire puzzle graph is covered without overlaps by the graphs of the parts. Alternatively, we reduce the puzzle problem to a submatrix-selection problem, and solve the latter problem by using the "dancing-links" trick of Knuth. A few expediting heuristics are discussed, and experimental results on various lattice puzzles are presented.