From 7581d6af39e90bddca7075fd66174d54460f0ba6 Mon Sep 17 00:00:00 2001
From: Alexandre Tolstenko <tolstenko@gmail.com>
Date: Tue, 3 Oct 2023 00:10:18 -0400
Subject: [PATCH] Update MazeDataStructures.md

---
 blog/posts/MazeDataStructure/MazeDataStructures.md | 2 +-
 1 file changed, 1 insertion(+), 1 deletion(-)

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?