Keeping Jigsaws Connected

Abstract

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