Combinatorial analysis of tetris-like games (Q941345): Difference between revisions

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.