CSE 571 Artificial Intelligence

Automatic maze generator (DFS) and maze solver (A*, DFS, BFS) in python.

Simple graph classes

Romania Problem with A* Algorithm - AI Class Homework

Desktop app for visualizing graph search algorithms

8 Puzzle solver using uninformed and informed search algorithms as DFS, BFS and A*.

🕹 Algoritmo que resolve o jogo dos oito por busca em profundidade(sem estados visitados), busca em largura(com estados visitados), busca gulosa(com estados visitados) e busca a*(com estados visitados). Podendo mostrar passo a passo das escolhas dos nós e mostrando a árvore resultante(até um certo limite ou completa) do método de busca selecionado.

Implementations of artificial intelligence agents that plays Pac-Man

Learning Discrete World Models for Heuristic Search

A maze generator program and a solver agent implemented in python by Mahmoud Darwish (محمود درويش)

The N-puzzle is a sliding puzzle that consists of a frame of numbered square tiles in random order with one tile missing. The puzzle can be of any size, with the most common sizes being 3x3 and 4x4. The objective of the puzzle is to rearrange the tiles to form a specific pattern.

Robot that cleans room from dirts. Finds the optimum path eventually. Same algorithms are applied as in finding path to escape a maze.

AI Final Assignment, paper link: tinyurl.com/last-choice-ai

UC Berkeley CS188: Artificial Intelligence

This is my repository to work on the codes for ECE 276B project 2 - Motion Planning

This project implements path planning techniques as part of Udacity's Flying Car Nanodegree program.

Explore a map to find an optimal path from start to goal using classical search-based methods

Python program to implement graph based A* algorithm on a map of Romania

In this, we solved a maze using both Greedy Best First Search Algortihm and A* Algorithm

Lab: Teaching Pac-Man to Search | Artificial Intelligence Nanodegree | Udacity