Combinatorial analysis of tetris-like games
type: Item
instance of: scholarly article
title: Combinatorial analysis of tetris-like games
zbMATH Open document ID: 1146.91013
author: Davide Baccherini
author: Donatella Merlini
published in: Discrete Mathematics
publication date: 2008-09-04T00:00:00Z
review text: Combinatorial properties of tetris-like games are studied by using Schützenberger methodology and probability generating functions. It is proved that every tetris-like game is equivalent to a finite state automaton. A straightforward algorithm to transform a Tetris-like game into its corresponding automaton is presented. In this way, one can study the average number of pieces inserted during a game and the average score as a function of the player's ability and the pieces extrusion.
reviewed by: Giacomo Bonanno
Mathematics Subject Classification ID: 91A46
Mathematics Subject Classification ID: 68Q15
Mathematics Subject Classification ID: 05A15
zbMATH DE Number: 5321287
zbMATH Keywords: finite state automaton
zbMATH Keywords: Schützenberger methodology
zbMATH Keywords: probability generating functions
MaRDI profile type: Publication
full work available at URL: j.disc.2007.08.009
OpenAlex ID: W2069043956
cites work: Tablatures for Stringed Instruments and Generating Functions
cites work: TETRIS IS HARD, EVEN TO APPROXIMATE
cites work: Tiling rectangles with polyominoes
cites work: Tetris and decidability
cites work: The statistics of dimers on a lattice. I: The number of dimer arrangements on a quadratic lattice
cites work: Domino tilings of rectangles with fixed width
cites work: Q4331187
cites work: Strip tiling and regular grammars
cites work: A strip-like tiling algorithm
cites work: On context-free languages and push-down automata
cites work: Q4855565
cites work: On dimer coverings of rectangles of fixed width
DOI: 10.1016/J.DISC.2007.08.009
description: scientific article; zbMATH DE number 5321287