Optimal conjoining of chords and simultaneous conducting of melodic lines
In the case of unison compositions, finding the optimal melodic line is very easy. However, with twopart and polyphonic pieces, we must conduct two or more melodic lines simultaneously, while each one of them must satisfy the principle of economy. In this chapter we will examine the counterpoint conducting of melodic lines while according to the principle of economy. Its basis is the optimal conjunction of tone pairs. Let us take two pairs of tones y_{1}, y_{2} and y_{1}', y_{2}', i.e., the intervals i and i'. Our goal is to optimally conjoin them:
For example, let these pairs of tones be given: c^{1}, e^{1} and d^{1}, b^{1}. Two conjunctions are possible:
In this way, the optimal conducting of two simultaneous melodic lines is reduced to optimal conjunctions of neighboring pairs of tones. This still does not mean that all key prerequisites for a counterpoint have been met. The next prerequisite is the elimination of parallel and antiparallel movements, that can occur during conjunctions. With the first conjunction, parallel movement will occur if i_{11}=i_{22} mod 12, and antiparallel if i_{11}+i_{22}=0 mod 12. With the second conjunction parallel movement occurs if i_{12}=i_{21} mod 12, and antiparallel if i_{12}=i_{12} mod 12. In this situation we may avoid parallel movement or give priority to some other aspects (e.g., harmonic), opting for the closest to optimal conjunctions.
Figure 4.3 The conjunction of tone pairs C^{1}, D^{1} and E^{1}, B^{1}. Conjunction (d) is optimal. The problem of conjoining pairs of tones, the elimination of parallel and antiparallel movements, and the optimal conducting of counterpoint melodic lines may be very effectively solved by applying a simple computer program. In the case of polyphony, these problems are dealt with in an identical manner and require only the check of a large number of combinations  all possible conjunctions. Thus, when conjoining two triads, there are 6 combinations, the conjunction of two seventhchords gives 24 combinations, and the conjunction of two ninthchords gives 120 possible combinations. From all these combinations we choose the optimal ones. After that, by applying the same process as before, we look for the optimal conjunction, eliminate parallel and antiparallel movements and resolve all related issues. To illustrate this we will show an algorithmic procedure which permits the optimal conjunction of two triads, regardless of whether they are incomplete triads (generated by doubling of one tone), full triads, the conjunction of a full triad with an incomplete one, or vice versa. Let us examine two triads y_{1},y_{2},y_{3} and y_{1}',y_{2}'y_{3}', which give six possible conjunctions:
A visual scheme of all possible conjunctions is made by fixing the tones of the first triad, then permuting the tones of the second triad and finally conjoining them to the tones of the first triad (Fig. 4.4).
Figure 4.4 The schematic conjunction of two triads. The next step is reducing all intervals to samename simple ascending intervals. After that, we will either keep the simple ascending intervals, or transform them into samename complementary intervals, depending on whether they exceed or not the value of 6. Finally, we will calculate the sum of the obtained minimal intervals and find the optimal conjunction, i.e., the one which has the smallest sum of minimal intervals. After that we may verify whether parallel or antiparallel movements occur with the chosen optimal conjunction. With some conjunctions parallel movements occur when any two intervals in a conjunction are equal modulo 12. In the event that unwanted parallel or antiparallel movements do occur (e.g., parallel fifths or octaves), we will chose the conjunction closest to the optimal, i.e., the conjunction that corresponds to the next available value of minimal intervals. Likewise, it is possible to find the optimum conjunction of two fivenote chords with or without a repeated tone. A scheme of 24 possible combinations of intervals of conjunction, obtained by fixing the tones of the first fournotechord and their conjunction with the permuted tones of the second seventhchord is shown in Fig. 4.5.
3 3 4 2 4 2 3 3 4 1 4 1 3 2 4 1 4 1 2 2 3 1 3 1 2 2 2 2 3 3 4 4 1 1 3 3 4 4 1 1 2 2 4 4 1 1 2 2 3 3 1 1 1 1 1 1 1 2 2 2 2 2 2 3 3 3 3 3 3 4 4 4 4 4 4
Determining a sequence of conjunctions of two triads or two seventhchords, which begin with an optimal conjunction and decrease in economy, as well as the registering of parallel and antiparallel movements, can be done very effectively by using a computer program. As an example we will show the optimal conjunction of a seventhchord on the main notes of C major (TSD), made by the computer program (Fig. 4.6)
Figure 4.6 The optimal conjunction of a seventhchords on the main notes of C major (TSD).
