UC Berkeley AI Pacman Project
Ares-Adventure is a Python-based Sokoban puzzle solver that implements four search algorithms: BFS, DFS, UCS and A*
Homework Assignments Completed as a part of the course on "Foundations of Artificial Intelligence" at USC.
C# desktop app for Design & Analysis of Algorithms course — implements and visualizes search algorithms (BFS, DFS, UCS, GBFS).
The AI Searches repository provides a Jupyter Notebook demonstrating the implementation of various AI search algorithms commonly used in optimization and pathfinding problems. It includes algorithms such as Breadth-First Search (BFS), Depth-First Search (DFS), Uniform Cost Search (UCS), Greedy Best-First Search, and A* Search.
Heuristic - Blind Search algoritms for navigation and Minimax algorithm for a game
Maze Solver using AI
exploring diffrent search algorithms, in order to solve graph coloring problem
Introduction to Artificial Intelligence - Assignment 13 Search Algorithms DFS, BFS, UCS, A* & Heuristic Functions
Engineered a proficient and competent mars rover search agent in python which can give the shortest path by using 4 different algorithms ( A*-UCS-BFS ) for Mars rover by taking care of given obstacles on Mars. Designed multiple heuristics function and chose the best one.
Graph Search Algorithms for Intro to AI class at UFMG
To associate your repository with the ucs-search topic, visit your repo's landing page and select "manage topics."