Loading…
Generalization of Haberdasher’s Puzzle
In this paper, we scrutinize the Haberdasher’s puzzle by Dudeney to produce equi-rotational pairs of figures systematically. We also generalize the puzzle by considering the tessellability condition (strong tessellability) for a pair of figures. As a result of it, it is shown that all pairs of stron...
Saved in:
Published in: | Discrete & computational geometry 2017-07, Vol.58 (1), p.30-50 |
---|---|
Main Authors: | , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that this one cites Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Summary: | In this paper, we scrutinize the Haberdasher’s puzzle by Dudeney to produce equi-rotational pairs of figures systematically. We also generalize the puzzle by considering the tessellability condition (strong tessellability) for a pair of figures. As a result of it, it is shown that all pairs of strong tessellative and equi-rotational figures satisfy Conway criterion. |
---|---|
ISSN: | 0179-5376 1432-0444 |
DOI: | 10.1007/s00454-017-9876-9 |