A global approach to automatic solution of jigsaw puzzles

We present a new algorithm for automatically solving jigsaw puzzles byshapealone.Thealgorithm cansolvemore difficult puzzlesthan couldbesolved before, without the use of backtracking or branch-and-bound. The algorithm can handle puzzlesin which pieces border more than four neighbors, and puzzles with as many as 200 pieces. The algorithm follows the overall strategy of previous algorithms but applies a number of new techniques, such as robust fiducial points, "highest-confidence-first"search,and frequent global reoptimization of partial solutions.

• Type: Journal
• Year: 2004
• Where: COMGEO
• Authors: David Goldberg, Christopher Malon, Marshall W. Bern
• Keywords: Algorithms, Applied Computing, COMGEO 2004, Puzzles, Robust Fiducial Points