BFS, Greedy Best-First Search, Dijkstra and A* path finding algorithms

A very fast & zero-allocation, grid-based, pathfinding library for Go.

This is an Artificial Intelligence project which solves the 8-Puzzle problem using different Artificial Intelligence algorithms techniques like Uninformed-BFS, Uninformed-Iterative Deepening, Informed-Greedy Best First, Informed-A* and Beyond Classical search-Steepest hill climbing.

Visualization of A* Search, Greedy BFS and Djikstra Search execution

Inspired by the android game Greedy Spiders but in C

Repository for the S5 AI Algorithms (2019 Scheme) at Kerala Technological University (KTU), featuring practical experiments on AI Algorithms like Basic search strategies, informed search algorithms, constraint satisfaction problems. etc.,

University course exercises

Path finding visualisation using javascript

pyGraphr - A Python Graph Traversal Visualizer for applying search algorithms.

Given the size n, initial state, and search method, you can solve a sliding puzzle through the use of BFS, DFS, GBFS, and/or AStar.

A python package for greedybfs implementaion

This repo contains the source code for Microsoft-Engage-2020 Mentorship Programme. The repository consists of two projects namely path finding and tic-tac-toe

This Python script implements the Greedy Best-First Search (GBFS) algorithm to solve a maze using the Turtle graphics library. The program visually represents the maze and the search process, allowing users to observe how the algorithm explores paths to find a solution based on heuristic evaluation.

maze generator and pathfinding visualizer

A* in Unity if you need to do it yourself