A global approach to automatic solution of jigsaw puzzles

Citations of this article
Mendeley users who have this article in their library.


We present a new algorithm for automatically solving jigsaw puzzles by shape alone. The algorithm can solve more difficult puzzles than could be solved before, without the use of backtracking or branch-and-bound. The algorithm can handle puzzles in which pieces border more than four neighbors, and puzzles with as many as 200 pieces. Our overall strategy follows that of previous algorithms but applies a number of new ideas, such as robust fiducial points, "highest-confidence-first" search, and frequent global reoptimization of partial solutions. © 2004 Elsevier B.V.




Goldberg, D., Malon, C., & Bern, M. (2004). A global approach to automatic solution of jigsaw puzzles. In Computational Geometry: Theory and Applications (Vol. 28, pp. 165–174). https://doi.org/10.1016/j.comgeo.2004.03.007

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free