From 1cae67a11ea3a15749f98ef0d54ade8bb657c355 Mon Sep 17 00:00:00 2001 From: yogeshkumar94 Date: Mon, 19 Oct 2020 21:33:31 +0200 Subject: [PATCH] Algorithm Visualizer Contribution - 3D PathFinder Hello Coding Train team, I would like to contribute to the 3D A-star algorithm visualizer along with many other algorithms. Demo: https://b-yogesh.github.io/3D-PathFinder/ --- _CodingChallenges/051.1-astar.md | 6 ++++++ 1 file changed, 6 insertions(+) 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.