Includes visualization of BFS, A*, Greedy best-first search, Bidirectional BFS, Bidirectional swarm, algorithm, as well as maze generator and other functions. All in C# windows forms

Implémentation des méthodes suivantes de pathfinding: breadth first search, uniform cost search et greedy best first search.

C# desktop maze playground! You can generate and edit a maze, change all sorts of visual settings and then export it into a picture. Also, you can choose a start/end node and visualize three different algorithms for finding the shortest path. Additionally, walls of each node are also editable.

A maze game made with Phaser 3.

Implementation of popular AI algorithms

8 Puzzle game

UoE Informatics Large Practical Coursework 2 - Air Quality Map

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

A Maze Solving Agent using greedy best first search and A*star algorithms

In this project, state space search algorithms were implemented to solve the game Rush Hour. Uninformed search, Uniform Cost, and informed searches Greedy-Best First Search and Algorithms A/A*. All game logic and data structures were implemented with an original design.

Simple Python project that uses standard libraries in conjunction with PyGame for the GUI. Allows the user to create a maze using their mouse, define starting position [S_i,S_j], goal position [G_i,G_j], and run different pathfinding algorithm visualizations from informed (Greedy, A*) to uninformed (DFS,BFS) and choose between L1 and L2 heuristics

classical search algorithms are used in AI | AI course - Fall 2018

Finds the best solution path for a maze using artificial intelligence

This is a homework about various Uninformed and Informed search algorithms, implemented for solving a simple game. This homework is a part of many projects in a Fundamentals to AI course @ FUM.

Best-First-Search | Breadth-First-Search | Depth-First-Search | Greedy-Best-First-Search | A-Star-Search

Search algorithms for 8-puzzle problem search problem and traveling salesman optimization problem.

Visualization tool of path finding algorithms

This is a code repository for the solves a routing problem with the help of several AI search strategies like BFS, DFS, A* (A-Star), etc.