PT Journal
AU Oppen, J
TI Keeping Jigsaws Connected
SO Communications - Scientific Letters of the University of Zilina
PY 2013
BP 49
EP 53
VL 15
IS 1
DI 10.26552/com.C.2013.1.49-53
WP https://komunikacie.uniza.sk/artkey/csl-201301-0009.php
DE combinatorics; puzzles; counting
SN 13354205
AB 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.
ER