In this algorithm, I have written a module which is consist of a couple of main searching algorithm that has been implemented on the 8 puzzle problem as default.

Maze solver using BFS, DFS, Greedy and UCS.

First Assignment in 'Artificial Intelligence' course by Dr. Ram Meshulam at Bar-Ilan University

Implementation of artificial intelligence search algorithms for robot movement on the table.

Proyecto Transmilenio para buscar la mejor ruta entre multiples estaciones usando algoritmos de busqueda de Inteligencia Artificial progrmado en Python

Maze Project on the subject of Uninformed search in artificial intelligence and expert systems course

a robot that carrying butter on the table with using search algorithms

This is phase 1 of my AI project. By using different search algorithms ( DFS, BFS, UCS, A*), I tried to make Pacman do better in eating all the nodes and be alive.

A website made to calculate shortest path using uniform cost search and A* algorithm

In this project I had to compare 3 algorithm's on the bases of there execution time. There are 3 AI algorithm's which were assign to me in these algorithm's two are uninform and one is inform. And the names of the algorithm's are: 1-DFS, 2-UCS, and A*

Informed and uniformed search algorithm for 15 puzzle

AI Search methods from CAP 4630: Intro to AI

Tugas Kecil 3 Strategi Algoritma IF2211 - Shortest Path Problem Solver using UCS and A* Algorithm

CSCI561-Foundations of AI Coding Assignment-1

Implementation of Greedy, Uniform Cost Search (UCS), and A* Search algorithms to find seating arrangements with minimal conflict.

Projeto criado para disciplina Inteligência Artificial, Com objetivo de calcular uma rota entre os dois pontos usando os seguintes algoritmos: ○ Busca em Largura ○ Busca em profundidade (podendo ser o limitado) ○ Busca de custo uniforme ○ A*

8 Puzzle game

It creates and visualizes trees and supports various search algorithms such as BFS, DFS, UCS, A*, Best-First Search, IDS, and Backtracking

Path-finding via BFS, UCS, and A* Search