created in cooperation with asolopov
final score 100/100
The goal of this project is to fit given tetriminoes (1 to 26 of them) into smallest possible square without rotation and with order preference. The appearance order preference forces into use of recursion, which results in slow output times for 13 tetriminoes and more.