@inproceedings{fec0162a9c054b47b2f8e13f3fa0c24e,
title = "Counting Polyominoes, Revisited",
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.",
keywords = "Polyominoes, counting algorithms, lattice animals",
author = "Gill Barequet and Gil Ben-Shachar",
note = "Publisher Copyright: Copyright {\textcopyright} 2024 by SIAM.; 2024 SIAM Symposium on Algorithm Engineering and Experiments, ALENEX 2024 ; Conference date: 07-01-2024 Through 08-01-2024",
year = "2024",
language = "الإنجليزيّة",
series = "Proceedings of the Workshop on Algorithm Engineering and Experiments",
pages = "133--143",
booktitle = "2024 Proceedings of the Symposium on Algorithm Engineering and Experiments, ALENEX 2024",
}