Effective algorithm for placing differently sized elements in adjacent fields

The paper discusses the method for searching the optimal placement of differently sized elements in several adjacent fields based on the formation of modular curriculum. The proposed algorithm is based on the formation of subsequences with the maximum length from connected elements, effective selection of the placement initial element and allows selecting the optimal curriculum based on the criterion of gradual knowledge accumulation.