Heesch Numbers of Unmarked Polyforms

05/20/2021
by   Craig S. Kaplan, et al.
0

A shape's Heesch number is the number of layers of copies of the shape that can be placed around it without gaps or overlaps. Experimentation and exhaustive searching have turned up examples of shapes with finite Heesch numbers up to six, but nothing higher. The computational problem of classifying simple families of shapes by Heesch number can provide more experimental data to fuel our understanding of this topic. I present a technique for computing Heesch numbers of non-tiling polyforms using a SAT solver, and the results of exhaustive computation of Heesch numbers up to 19-ominoes, 17-hexes, and 24-iamonds.

READ FULL TEXT
research
06/30/2020

A Computational Criterion for the Irrationality of Some Real Numbers

In this paper, we compute the asymptotic average of the decimals of some...
research
07/26/2022

Searching on the boundary of abundance for odd weird numbers

Weird numbers are abundant numbers that are not pseudoperfect. Since the...
research
01/22/2021

Rikudo is NP-complete

Rikudo is a number-placement puzzle, where the player is asked to comple...
research
03/20/2018

Eleven Simple Algorithms to Compute Fibonacci Numbers

The Fibonacci numbers are a sequence of integers in which every number a...
research
03/20/2018

Twelve Simple Algorithms to Compute Fibonacci Numbers

The Fibonacci numbers are a sequence of integers in which every number a...
research
06/30/2022

Abstract morphing using the Hausdorff distance and Voronoi diagrams

This paper introduces two new abstract morphs for two 2-dimensional shap...
research
02/02/2015

Complex-Valued Hough Transforms for Circles

This paper advocates the use of complex variables to represent votes in ...

Please sign up or login with your details

Forgot password? Click here to reset