Polyiamonds and polyhexes with minimum site-perimeter and achievement games
From MaRDI portal
Publication:976716
Summary: An animal is an edge connected set of finitely many cells of a regular tiling of the plane. The site-perimeter of an animal is the number of empty cells connected to the animal by an edge. The minimum site-perimeter with a given cell size is found for animals on the triangular and hexagonal grid. The formulas are used to show the effectiveness of a simple random strategy in full set animal achievement games.
Recommendations
- Polyominoes with minimum site-perimeter and full set achievement games
- Minimal-perimeter polyominoes: chains, roots, and algorithms
- scientific article; zbMATH DE number 2211804
- Properties of minimal-perimeter polyominoes
- Properties of minimal-perimeter polyominoes (multimedia exposition)
- Polyominos and perfect graphs
- Rectangular polyomino set weak (1,2)-achievement games
- On Minimal Perimeter Polyminoes
- Polytope games
- scientific article; zbMATH DE number 718850
Cited in
(7)- On minimal-perimeter lattice animals
- The site-perimeter of compositions
- Metastability for the Ising model on the hexagonal lattice
- Minimum-perimeter lattice animals and the constant-isomer conjecture
- Polyominoes with minimum site-perimeter and full set achievement games
- Algorithms for counting minimum-perimeter lattice animals
- The site-perimeter of words
This page was built for publication: Polyiamonds and polyhexes with minimum site-perimeter and achievement games
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q976716)
