The behaviour of a bad Tetris player suggests a class of polyominoes that we call prefix-closed. Such a class contains all polyominoes P such that for any integer i > 0 the first i columns of P form a polyomino. We provide a simple discrete dynamical system that allows us to define an algorithm for generating all prefix- closed polyominoes of size n in constant amortized time using O(n) space.

From Tetris to polyominoes generation

MASSAZZA, PAOLO;
2017-01-01

Abstract

The behaviour of a bad Tetris player suggests a class of polyominoes that we call prefix-closed. Such a class contains all polyominoes P such that for any integer i > 0 the first i columns of P form a polyomino. We provide a simple discrete dynamical system that allows us to define an algorithm for generating all prefix- closed polyominoes of size n in constant amortized time using O(n) space.
File in questo prodotto:
Non ci sono file associati a questo prodotto.

I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.

Utilizza questo identificativo per citare o creare un link a questo documento: https://hdl.handle.net/11383/2063173
 Attenzione

L'Ateneo sottopone a validazione solo i file PDF allegati

Citazioni
  • ???jsp.display-item.citation.pmc??? ND
  • Scopus 7
  • ???jsp.display-item.citation.isi??? ND
social impact