The is the source code for a project I undertook in 2011 to determine whether or not it is always possible to get at least one line in Tetris.

This main branch has the code as it was around the time I ultimately abandoned the project around 2011. This branch is most similar to the v1 branch, as opposed to the v2 branch, which uses unlimited amounts of memory to cache intermediate results, and was abandoned as an impractical approach.