Polyiamonds and polyhexes with minimum site-perimeter and achievement games (Q976716)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: Polyiamonds and polyhexes with minimum site-perimeter and achievement games |
scientific article; zbMATH DE number 5721459
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Polyiamonds and polyhexes with minimum site-perimeter and achievement games |
scientific article; zbMATH DE number 5721459 |
Statements
Polyiamonds and polyhexes with minimum site-perimeter and achievement games (English)
0 references
16 June 2010
0 references
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.
0 references
0 references
0.8803001
0 references
0.8673305
0 references
0 references
0.8411457
0 references
0 references
