Preprintreihe der Fakultät für Mathematik der TU Chemnitz, Preprint 2017-07
ISSN
1614-8835
Abstract (EN)
Given a square with integer side length n, we ask for the number of different ways to divide it into sub-squares, considering only the list of parts. We enumerate all possible lists and check whether a placement with those squares is possible. In order to do this, we propose a new algorithm for creating perfect square packings.