Polyiamonds and polyhexes with minimum site-perimeter and achievement games
type: Item
instance of: scholarly article
title: Polyiamonds and polyhexes with minimum site-perimeter and achievement games
zbMATH Open document ID: 1207.05033
author: Gábor Fülep
author: Nándor Sieben
published in: The Electronic Journal of Combinatorics
publication date: 2010-06-16T00:00:00Z
full work available at URL: https://eudml.org/doc/225592
full work available at URL: v17i1r65.html
review text: 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.
Mathematics Subject Classification ID: 05B50
Mathematics Subject Classification ID: 91A46
zbMATH DE Number: 5721459
MaRDI profile type: Publication
Recommended article: Polyominoes with minimum site-perimeter and full set achievement games
Recommended article: Minimal-perimeter polyominoes: chains, roots, and algorithms
Recommended article: Q5694621
Recommended article: Properties of minimal-perimeter polyominoes
Recommended article: Q5088997
Recommended article: Polyominos and perfect graphs
Recommended article: Rectangular polyomino set weak \((1,2)\)-achievement games
Recommended article: On Minimal Perimeter Polyminoes
Recommended article: Polytope games
Recommended article: Q4320806
description: scientific article; zbMATH DE number 5721459