Combinatorial analysis of Tetris-like games |
| |
Authors: | Davide Baccherini |
| |
Institution: | Dipartimento di Sistemi e Informatica, Viale Morgagni 65, 50134 Firenze, Italy |
| |
Abstract: | We study some combinatorial properties of Tetris-like games by using Schützenberger methodology and probability generating functions. We prove that every Tetris-like game is equivalent to a finite state automaton and propose a straight foward 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. |
| |
Keywords: | Tetris-like games Schü tzenberger methodology Probability generating functions |
本文献已被 ScienceDirect 等数据库收录! |