Hostname: page-component-76d6cb85b7-vdhp9 Total loading time: 0 Render date: 2026-07-16T13:57:06.079Z Has data issue: false hasContentIssue false
  • English
  • Français

A Linear Threshold for Uniqueness of Solutions to Random Jigsaw Puzzles

Part of: Combinatorial probability Graph theory

Published online by Cambridge University Press:  08 January 2019

ANDERS MARTINSSON
ANDERS MARTINSSON*
Affiliation:
Institute of Theoretical Computer Science, ETH Zürich, 8092 Zürich, Switzerland (e-mail: maanders@inf.ethz.ch)
Rights & Permissions [Opens in a new window]

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

We consider a problem introduced by Mossel and Ross (‘Shotgun assembly of labeled graphs’, arXiv:1504.07682). Suppose a random n × n jigsaw puzzle is constructed by independently and uniformly choosing the shape of each ‘jig’ from q possibilities. We are given the shuffled pieces. Then, depending on q, what is the probability that we can reassemble the puzzle uniquely? We say that two solutions of a puzzle are similar if they only differ by a global rotation of the puzzle, permutation of duplicate pieces, and rotation of rotationally symmetric pieces. In this paper, we show that, with high probability, such a puzzle has at least two non-similar solutions when 2 ⩽ q ⩽ 2e−1/2n, all solutions are similar when q ⩾ (2+ϵ)n, and the solution is unique when q = ω(n).

MSC classification

Primary: 60C05: Combinatorial probability
Secondary: 05C10: Planar graphs; geometric and topological aspects of graph theory

Information

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 28 , Issue 2 , March 2019 , pp. 287 - 302
Copyright
Copyright © Cambridge University Press 2019 

References

[1] Balister, P., Bollobás, B. and Narayanan, B. (2017) Reconstructing random jigsaws. In Multiplex and Multilevel Networks, Oxford University Press, to appear, ISBN 9780198809456Google Scholar
[2] Bordenave, C., Feige, U. and Mossel, E. (2016) Shotgun assembly of random jigsaw puzzles. arXiv:1605.03086Google Scholar
[3] Bosboom, J., Demaine, E. D., Demaine, M. L., Hesterberg, A., Manurangsi, P. and Yodpinyanee, A. (2017) Even 1 × n edge-matching and jigsaw puzzles are really hard. J. Inform. Process. 25 682–694.Google Scholar
[4] Demaine, E. D. and Demaine, M. L. (2007) Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity. Graphs Combin. 23 (Suppl. 1) 195–208Google Scholar
[5] Martinsson, A. (2016) Shotgun edge assembly of random jigsaw puzzles. arXiv:1605.07151Google Scholar
[6] Mossel, E. and Ross, N. (2018) Shotgun assembly of labeled graphs, in IEEE Transactions on Network Science and Engineering. doi: 10.1109/TNSE.2017.2776913Google Scholar
[7] Nenadov, R., Pfister, P. and Steger, A. (2017) Unique reconstruction threshold for random jigsaw puzzles. Chicago J. Theoret. Comput. Sci. 23 2.Google Scholar
[8] PR Newswire, 16 February 2007, description of Eternity II release: http://www.prnewswire.co.uk/news-releases/eternity-puzzle-is-back-this-summer-with-a-us2-million-prize-for-the-first-person-to-find-a-solution-153539245.htmlGoogle Scholar