The use of a Genetic Algorithm for Music Harmonization of Transitional Fragments in Computer Games

1Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

The problem of musical accompaniment harmonization for adjacent transitional fragments in computer games is considered. A harmonization method based on a tonal model of the musical composition in conjunction with a genetic algorithm seeking the global extremum of the harmonic function is proposed. For the method under consideration, all operators of the genetic algorithm and fitness functions are defined. A scheme was developed for the formation of transitional musical compositions and a flowchart was proposed for using the genetic algorithm in its implementation. Using examples of well-known musical compositions, a study was conducted of the genetic algorithm features and its most appropriate parameters were found in the context of the problem under consideration. This allowed us to obtain expression for the computational costs of the proposed method, which are necessary for balancing the computational load in the computer between the game algorithm itself and the musical harmonization algorithm. Moreover, the study showed that using genetic algorithm allows even for a small number of iterations to achieve melody harmonization level no worse than professional composer achieved, and even exceed this level when performing extra iterations.

Cite

CITATION STYLE

APA

Komarov, O., Galchonkov, O., Nevrev, A., & Babilunga, O. (2020). The use of a Genetic Algorithm for Music Harmonization of Transitional Fragments in Computer Games. International Journal of Computing, 19(3), 365–376. https://doi.org/10.47839/IJC.19.3.1886

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free