Determine how to fill a wall with shelves of certain widths

puzzle_shelves.kts

fun maximalSplits(pieces: List<Int>, width: Int): List<Pair<Map<Int, Int>, Int>> {
    fun maximalSplits(partial: List<Int>): List<List<Int>> {
        val longerSplits = pieces
                .filter { partial.sum() + it < width }
                .map { (partial + it).sorted() }
                .flatMap { maximalSplits(it) }
                .distinct()

        if (longerSplits.isEmpty()) {
            return listOf(partial)
        } else {
            return longerSplits
        }
    }

    return maximalSplits(emptyList())
            .map { Pair(it.groupBy { it }.mapValues { it.value.count() }, it.sum()) }
}


val pieces = args[0].split(",").map(String::toInt)
val width = args[1].toInt()

val splits = maximalSplits(pieces, width)
println(splits)