diff --git a/_CodingChallenges/051.1-astar.md b/_CodingChallenges/051.1-astar.md
index e636f049ce..427d45f622 100644
--- a/_CodingChallenges/051.1-astar.md
+++ b/_CodingChallenges/051.1-astar.md
@@ -94,6 +94,12 @@ contributions:
       name: "Kaapeine"
       url: "https://github.com/Kaapeine/"
     url: "https://github.com/Kaapeine/MotionPlanningAlgorithmsVisualizer/"
+  - title: "3D PathFinder"
+    author:
+      name: "Yogesh Kumar"
+      url: "https://github.com/b-yogesh"
+    url: "https://b-yogesh.github.io/3D-PathFinder/"
+    source: "https://github.com/b-yogesh/3D-PathFinder"
 ---
 
 In this coding challenge, I attempt an implementation of the A* Pathfinding Algorithm to find the optimal path between two points in a 2D grid.  I begin by explaining the mechanics of how the algorithm works, look at pseudo-code, and then write the algorithm in JavaScript using the p5.js library for rendering.