
handle: 2158/254228
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.
Probability generating functions, Exact enumeration problems, generating functions, Tetris-like games, Complexity classes (hierarchies, relations among complexity classes, etc.), finite state automaton, probability generating functions, Discrete Mathematics and Combinatorics, Combinatorial games, Schützenberger methodology, Theoretical Computer Science
Probability generating functions, Exact enumeration problems, generating functions, Tetris-like games, Complexity classes (hierarchies, relations among complexity classes, etc.), finite state automaton, probability generating functions, Discrete Mathematics and Combinatorics, Combinatorial games, Schützenberger methodology, Theoretical Computer Science
| selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | 8 | |
| popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network. | Average | |
| influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically). | Top 10% | |
| impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network. | Average |
