This program implements a 1-dimensional Markov model of Beethoven's Ode to Joy melody. To begin, the melody pitches from Beethoven's Ode to Joy were written out: eefggfedccdeeddeefggfedccdedccddecdefecdefedcdgeefggfedccdedcc These note names were then converted to MIDI numbers: C = 60, D = 62, E = 64, F = 65, & G = 67. Starting at the beginning, a probability table was created charting the deltas between and frequencies of each successive note the in the melody. These were then populated into Lists displayed on the Scratch stage: 64 moves to: 64 64 65 65 65 65 65 62 62 62 62 62 62 62 64 64 60 60; 60 moves to: 60 60 60 60 60 62 62 62 62 62 62 62; 65 moves to: 67 67 67 64 64 64 64 64 64; 62 moves to: 67 60 60 60 60 60 60 64 64 64 64 64 64 64 62 62; 67 moves to: 64 67 65 65 65; For example, the note 67 moves to 64 one out of five times, to the note 67 one out of five times, and to the note 65 three out of five times. In the algorithm, the beginning note of Ode to Joy (64) is seeded and stored in the variable "CurrentNote" to begin the piece. After the first note is played, a broadcast to the event listener "PlayNote" is impemented. Through if statements, the "CurrentNote" serves as an index to the note probability lists. For example, the starting pitch of 64 is successfully evaluated by "if CurrentNote = 64." The algorithm then sets "CurrenNote" to a random item (item "any" of 64) from the "64" indexed pitch list and plays the selected pitch. Then, a callback "PlayNote" is broadcast to reevaluate the new "CurrentNote" and see which pitch index list from which to choose the next note. The result is a continuous, algorithmically created melody similar in note-to-note movement to Beethoven's Ode to Joy. This code was co-developed by Alex Ruthmann & Andrew R. Brown
