diff --git a/blog/posts/MazeDataStructure/MazeDataStructures.md b/blog/posts/MazeDataStructure/MazeDataStructures.md
index 7954ab08..d4de6e7e 100644
--- a/blog/posts/MazeDataStructure/MazeDataStructures.md
+++ b/blog/posts/MazeDataStructure/MazeDataStructures.md
@@ -14,7 +14,7 @@ authors:
   - tolstenko
 ---
 
-# Memory-efficient Data Structure for Maze Generation
+# Memory-efficient Data Structure for Procedural Maze Generation
 
 In this post, you will learn how to create a memory-efficient data structure for maze generation. We will jump from a 320 bits data structure to just 2! It is achieved by taking a bunch of clever decisions, changing the referential and doing some math. Be warned, this not for the fainted hearts. Are you brave enough?