Counting Polyominoes, Revisited

Gill Barequet, Gil Ben-Shachar

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

A polyomino is an edge-connected set of squares on the square lattice. In this paper, we improve Jensen's algorithm for counting polyominoes by considering bounding boxes on the square lattice rotated by 45° instead of on the regular unrotated lattice. This allows us to extend significantly the count of polyominoes from 56 to 70 terms.

Original languageEnglish
Title of host publication2024 Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2024
Pages133-143
Number of pages11
ISBN (Electronic)9781611977929
StatePublished - 2024
Event2024 SIAM Symposium on Algorithm Engineering and Experiments, ALENEX 2024 - Alexandria, United States
Duration: 7 Jan 20248 Jan 2024

Publication series

NameProceedings of the Workshop on Algorithm Engineering and Experiments
ISSN (Print)2164-0300

Conference

Conference2024 SIAM Symposium on Algorithm Engineering and Experiments, ALENEX 2024
Country/TerritoryUnited States
CityAlexandria
Period7/01/248/01/24

Keywords

  • counting algorithms
  • lattice animals
  • Polyominoes

ASJC Scopus subject areas

  • General Engineering
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Counting Polyominoes, Revisited'. Together they form a unique fingerprint.

Cite this