A repository of offline javascript-powered tools for visualising 2D path planning on binary occupancy grids and LEGO-EV3 related activities.

The Breadth First Search Algorithm, written in P5JS

Project: Knights Travails

This is the updated project Breadth-First Search (BFS) algorithm to find the shortest path in a graph, now enhanced using Bootstrap frameworks The project also includes a map feature to visually represent the paths, making it easier for users to understand the possible routes and the shortest path.

I created a Breadth-First Search (BFS) algorithm for map traversal. The BFS algorithm used to explore all the vertices and edges in a graph efficiently. In this specific implementation, I have adapted BFS for map-like structures, where each location is represented as a node, and paths between locations are considered as edges.

🏝️ An algorithm for finding islands in a binary graph using BFS (Breadth First Search)

🔦 Breadth First Search algorithm for a matrix

This project explores Maze Generation Algorithms and Maze Search Algorithms

A web application showcasing pathfinding algorithms like BFS, A*, and Bi-directional Search with interactive demonstrations. Includes a maze generator for further exploration.

Project: Knights Travails

AI searching Algorithms Implementation with Nodejs

A browser game where pathfinding algorithms race against each other!

8-Puzzle Solver webapp it uses different search algorithms to solve the classic 8-puzzle problem.

Iterative method to make an array for infinite layers of folders (folders inside folders inside folders, etc)

Applying algorithms in real world system. https://suaebahmed.github.io/algorithms-visualizer/

Pathfinding Algorithms Visualization Tool made with React

Sliding puzzle with automated solving

An implementation of finding the shortest path between a knight and its destination using a breadth-first search algorithm.

A visual representation of the knight's optimal movement.