Exact Cover Problem in Milton Babbitt’s All-Partition Array
One aspect of analyzing Milton Babbitt’s (1916–2011) all-partition arrays requires finding a sequence of distinct, non-overlapping aggregate regions that completely and exactly covers an irregular matrix of pitch class integers. This is an example of the so-called exact cover problem. Given a set, A, and a collection of distinct subsets of this set, S, then a subset of S is an exact cover of A if it exhaustively and exclusively partitions A. We provide a backtracking algorithm for solving this problem in an all-partition array and compare the output of this algorithm with an analysis produced manually.
KeywordsBabbitt Knuth All-partition array Exact cover Computational music analysis
- 3.Bemman, B., Meredith, D.: From analysis to surface: generating the surface of Milton Babbitt’s Sheer Pluck from a parsimonious encoding of an analysis of its pitch-class structure. In: The Music Encoding Conference, Charlottesville, VA, 20–23 May 2014Google Scholar
- 5.Donald, K.: Dancing links. 22 February 2000. http://www-cs-faculty.stanford.edu/ uno/musings.html
- 7.Scott, D.S.: Programming a combinatorial puzzle. Technical report No. 1, Princeton University Department of Electrical Engineering, Princeton, NJ, 10 June 1958Google Scholar