diff --git a/README.md b/README.md
index e33a15f..98c79a4 100644
--- a/README.md
+++ b/README.md
@@ -1,3 +1,25 @@
 # Visual Maze Solver
 
-![Neutral Maze - Dijkstra](Testing.gif)
\ No newline at end of file
+## Overview
+This program is a basic maze solver that takes in the photo of a maze and outputs a photo of the solution. This program has an additional option to visualize the solving process to see how the pathfinding algorithm works.
+
+The point of this project was familiarize myself with graphs (networks of nodes), pathfinding algorithms (Dijkstra's and A*), multithreaded programming, and the SFML library. 
+
+## Showcase
+![Generated Small Maze - Dijkstra](<Maze Gifs/Generated Small Maze - Dijkstra.gif>)
+
+![Generated Small Maze 2 - Dijkstra](<Maze Gifs/Generated Small Maze 2 - Dijkstra.gif>)
+
+The following is the same maze solved with two different solving algorithms 
+
+Dijkstra's:
+![Generated 101x101 Maze - Dijkstra](<Generated 101x101 Maze - Dijkstra.gif>)
+
+A*:
+![Generated 101x101 Maze - A Star](<Generated 101x101 Maze - A Star.gif>)
+
+It should be noted that due to the fact that mazes usually only have one solution that is very intricate and does not always head directly towards the end goal, the advantage of A*'s direction heuristic tends to be marginalized. However, the advantage becomes more apparent in mazes made with various turns and solutions such as the following. 
+
+![Neutral Maze - Dijkstra](<Maze Gifs/Neutral Maze - Dijkstra.gif>)
+
+![Neutral Maze - A Star](<Maze Gifs/Neutral Maze - A Star.gif>)
\ No newline at end of file
diff --git a/Testing.gif b/Testing.gif
deleted file mode 100644
index 62f86fa..0000000
Binary files a/Testing.gif and /dev/null differ