Comments for generation of Markov chains file

Signed-off-by: ncordon <nacho.cordon.castillo@gmail.com>

Author: ncordon

src/sound/markov.go

@@ -27,16 +27,21 @@ func midiLoad(f string) []int {
 	return notes
 }
 
+// Transitions will store for a state (note identifier in midi) the
+// number of transitions to each other note, as observed in the midi file
 type Transitions map[int]map[int]uint32
+// A Markov chain is represented as a hash map with assigns state i -> [probability]
+// where the probability contains the state we can transition to as Key and an integer Value.
+// The array of probabilities is ordered increasingly by Value, where each value
+// represents an interval ]Value for prev state, Value] where the length of that
+// interval is proportional to the probability of going from i to Key
 type Markov map[int][]probability
 
 // Returns a Markov chain
 func NewMarkov(f string) Markov {
 	notes := midiLoad(f)
 	chain := make(Transitions)
 
-	// Parse the transitions, i.e. store for a state (note identifier in midi)
-	// the number of transitions to each other note, as observed in the midi file
 	previous := -1
 	for _, n := range notes {
 		if previous != -1 {