Combinatorial analysis of Tetris-like games

We study some combinatorial properties of Tetris-like games by using Schutzenberger methodology and probability generating functions. We prove that every Tetris-like game is equivalent to a finite state automaton and propose a straight Coward algorithm to transform a Tetris-like game into its corresponding automaton. In this way, we 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.