Communications - Scientific Letters of the University of Zilina 2013, 15(1):49-53 | DOI: 10.26552/com.C.2013.1.49-53

Keeping Jigsaws Connected

Johan Oppen1
1 Molde University College, Norway

This paper describes a combinatorial problem where the idea is to find out in how many ways a jigsaw puzzle can be built, piece by piece, in such a way that it stays connected at all times during the building phase. Computational methods, both exact and approximate, to count the number of such connected sequences are presented.

Keywords: combinatorics, puzzles, counting

Published: March 31, 2013  Show citation

ACS AIP APA ASA Harvard Chicago Chicago Notes IEEE ISO690 MLA NLM Turabian Vancouver
Oppen, J. (2013). Keeping Jigsaws Connected. Communications - Scientific Letters of the University of Zilina15(1), 49-53. doi: 10.26552/com.C.2013.1.49-53
Download citation

References

  1. gamesl.org. http://www.gamesl.org/games/place-states.swf.
  2. NYGREEN, B.: European Assembly Constituencies for Wales - Comparing of Methods for Solving a Political Districting Problem. Mathematical Programming, 42:159-169, 1988. Go to original source...
  3. APPEL, K., HAKEN, W.: Every Planar Graph is Four Colorable. Bulletin of the American Mathematical Society, 82(5):711-712, September 1976. Go to original source...
  4. JENSEN, T. R., TOFT, B.: Graph Coloring Problems. Wiley : New York, 1994. Go to original source...
  5. LEUNG, J. Y-T. editor: Handbook of Scheduling. Chapman & Hall, 2004. Go to original source...
  6. CARLSON, W. L., THORNE, B.: Applied Statistical Methods. Prentice Hall, Upper Saddle River, New Jersey, 1997.

This is an open access article distributed under the terms of the Creative Commons Attribution 4.0 International License (CC BY 4.0), which permits use, distribution, and reproduction in any medium, provided the original publication is properly cited. No use, distribution or reproduction is permitted which does not comply with these terms.