fix: improved data structure representation for maze

docs/artificialintelligence/assignments/maze/README.md

@@ -32,7 +32,7 @@ In order to be consistent with all languages and random functions the pseudo ran
 
 Every call to the random function should return the current number the index is pointing to, and then increment the index. If the index is greater than 99, it should be reset to 0.
 
-## Direction decision making
+## Direction decision-making
 
 In order to give consistency on how to decide the direction of the next cell, the following procedure should be followed:
 
@@ -41,6 +41,10 @@ In order to give consistency on how to decide the direction of the next cell, th
 3. If there is one visitable, do not call random, just return the first neighbor found;
 4. If there are two or more visitable neighbors, call random and return the neighbor at the index of the random number modulo the number of visitable neighbors. `vec[i]%visitableCount`
 
+!!! example "Data Structure"
+
+    Read the [Data Structure](maze-datastructure.md) page to understand how the maze could be represented in memory.
+
 ## Input
 
 The input is a single line with three `32 bits` unsigned integer numbers, `C`, `L` and `I`, where `C` and `L` are the number of columns and lines of the maze, respectively, and `I` is the index of the first random number to be used> `I` can varies from `0` to `99`.