AlgoMotion | Bogosort Plays Giant Steps w/ Scrolling Score #jazz #programming #improvisation #coltrane #algorithm @AlgoMotion | Uploaded January 2024 | Updated October 2024, 1 hour ago.
See the full video here: youtu.be/jVeot-svmFM
Bogosort sheds the Giant Steps changes, this time using a list with 8 elements, with a maj9 (add6) on every I, and an altered scale on every ii and V.
The Bogosort algorithm is as follows:
1. Randomly shuffle the list.
2. Check if the list is sorted.
3. If not, go back to 1.
For a list of n elements, there is a 1/n! chance that Bogosort successfully sorts the list on any given pass, since there are n! (n factorial) possible permutations of the list. So with eight elements, the odds of the list being sorted on any given pass is 1/8! = 1/40,320 ≈ 0.000025.
In this instance, the algorithm took 5329 passes to sort the list.
The eight elements of the list are mapped to the notes of a specific scale, depending on which chord is being played in the progression. On every I chord, the algorithm uses the notes of a maj9 (add6) chord rooted on the I, and on every ii and V chord, it uses the notes of an altered scale rooted on the V.
More precisely, the notes used over each chord are:
▶ I chords: 1, 2, maj3, 5, maj6, maj7, 9, maj3 (up an octave, i.e. maj10), rooted on the I chord
▶ ii and V chords: 1, min2, min3, ♭4, ♭5, min6, min7, 1 (octave), rooted on the V chord (the altered scale of the V)
The shuffling algorithm used is the Fisher–Yates Shuffle, from lowest index to highest. The note played is the value of the element at the current index in the outer for-loop of the shuffle algorithm.
The colors used to represent the three keys of the Coltrane changes are inspired loosely by Scriabin's note-to-color mapping:
▶ B major ↔ blue or pearly blue
▶ G major ↔ orange
▶ E♭ major ↔ flesh (glint of steel)
#jazz #algorithm #altered #music #coltrane #giantsteps #improvisation #bogosort #sortingalgorithm #sorting #visualization #computerscience #programming #code #satisfying
See the full video here: youtu.be/jVeot-svmFM
Bogosort sheds the Giant Steps changes, this time using a list with 8 elements, with a maj9 (add6) on every I, and an altered scale on every ii and V.
The Bogosort algorithm is as follows:
1. Randomly shuffle the list.
2. Check if the list is sorted.
3. If not, go back to 1.
For a list of n elements, there is a 1/n! chance that Bogosort successfully sorts the list on any given pass, since there are n! (n factorial) possible permutations of the list. So with eight elements, the odds of the list being sorted on any given pass is 1/8! = 1/40,320 ≈ 0.000025.
In this instance, the algorithm took 5329 passes to sort the list.
The eight elements of the list are mapped to the notes of a specific scale, depending on which chord is being played in the progression. On every I chord, the algorithm uses the notes of a maj9 (add6) chord rooted on the I, and on every ii and V chord, it uses the notes of an altered scale rooted on the V.
More precisely, the notes used over each chord are:
▶ I chords: 1, 2, maj3, 5, maj6, maj7, 9, maj3 (up an octave, i.e. maj10), rooted on the I chord
▶ ii and V chords: 1, min2, min3, ♭4, ♭5, min6, min7, 1 (octave), rooted on the V chord (the altered scale of the V)
The shuffling algorithm used is the Fisher–Yates Shuffle, from lowest index to highest. The note played is the value of the element at the current index in the outer for-loop of the shuffle algorithm.
The colors used to represent the three keys of the Coltrane changes are inspired loosely by Scriabin's note-to-color mapping:
▶ B major ↔ blue or pearly blue
▶ G major ↔ orange
▶ E♭ major ↔ flesh (glint of steel)
#jazz #algorithm #altered #music #coltrane #giantsteps #improvisation #bogosort #sortingalgorithm #sorting #visualization #computerscience #programming #code #satisfying
