Keeping Jigsaws Connected
Keeping Jigsaws Connected
Author(s): Johan OppenSubject(s): Methodology and research technology, Transport / Logistics
Published by: Žilinská univerzita v Žilině
Keywords: Combinatorics; puzzles; counting;
Summary/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.
Journal: Komunikácie - vedecké listy Žilinskej univerzity v Žiline
- Issue Year: 15/2013
- Issue No: 1
- Page Range: 49-53
- Page Count: 5
- Language: English