This repository contains implementation of different AI algorithms, based on the 4th edition of amazing AI Book, Artificial Intelligence A Modern Approach

Exmple of the A star algorithm

A simple search agent of an autonomous vacuum cleaner, trying to reach dirt spilled in different parts of a randomly generated room in the most efficient way possible. The project utilizes various search algorithms including, but not limited to; Greedy Search, Uniform Cost Search, and A* Search utilizing both path cost and a Manhattan heuristic.

This is a Python project that uses Tkinter to develop the front end of the application and Python to implement AI searches. This has a cool graphical interface and visualization to make the project look aesthetic.

An interactive tool which visualizes path finding algorithms on a grid.

An Artificial Intelligence Project based on UC Berkeley's Pacman AI course

Maze Solver with Searching Algorithms

DADI Lab에서 진행 중인 길찾기 알고리즘 관련 알고리즘 스터디 및 구현 결과를 관리하는 프로젝트입니다. (A project to manage the study and implementation results of the algorithm related to the wayfinding algorithm in progress at DADI Lab.)

This is using the UC Berkeley codebase for the PacMan AI project. This project utilizes search algorithms for artificial intelligence agents, and utilizes reinforcement learning.

This project aims to develop a motion planning algorithm for a firetruck, which is responsible for determining the most critical fire to extinguish while also accounting for newly occurring fires and spreading flames. The implementation is carried out using the Python pygame library, and the environment is simulated as a two-dimensional grid world.

Demonstration of A* algorithm in Python

A class that attempts to convert a string (initial state) to its anagram (goal state). It contains a heuristics function that helps the A* search algorithm find the optimal path from the initial state to the goal state.

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.

8 puzzle problem using artificial intelligence

This is a Maze Pathfinding Application that includes the A* Algo as-well as the BFS Algo

Jogo com algoritmo de busca para fugir de uma ou várias IA em um labirinto

This pathfinding algorithm find the shortest-path & Generate grid using maze-generation algorithm and add the ability of controlling the grid structure & distribution of the blocks and the position of the source and the destination.

ENPM 661 Project 3 Phase 2: A rigid robot traverses through a configuration space to find the goal node using A star search algorithm, while it avoid the obstacles in the map

Solves A-star search algorithm from a graph oh cities