The last decades, scientists have expressed an increasing interest for the game Tetris and more precisely for efficient algorithms that can score the most in-game points. A plethora of approaches have been tried out, including genetic algorithms, linear programming, cross-entropy and natural policy gradient, but none of them competes with experts players playing under no time pressure. In recent years, scientists have started applying reinforcement learning in Tetris as it displays effective results in adapting to video game environments, exploit mechanisms and deliver extreme performances. Current thesis aims to introduce Memory Based Learning, a reinforcement learning algorithm which uses a memory that helps in the training process by replaying past experiences.