Polyominoes with minimum site-perimeter and full set achievement games

Authors:
Nándor Sieben
Affiliations:
Department of Mathematics and Statistics, Northern Arizona University, Flagstaff, AZ 86011-5717, United States
Venue:
European Journal of Combinatorics
Year:
2008

Citing 3
Cited 3

Hexagonal polyomino achievement

Discrete Mathematics
The site-perimeter of bargraphs

Advances in Applied Mathematics
Hexagonal polyomino weak (1,2)-achievement games

Acta Cybernetica

On isoperimetrically optimal polyforms

Theoretical Computer Science
Rectangular polyomino set weak (1, 2)-achievement games

Theoretical Computer Science
Exhaustive generation of gominoes

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

The site-perimeter of a polyomino is the number of empty cells connected to the polyomino by an edge. A formula for the minimum site-perimeter with a given cell size is found. This formula is used to show the effectiveness of a simple random strategy in polyomino set achievement games.