A* puzzle implementation

Some assignments I did in the Artificial Intelligence Programming course at Norwegian University of Science and Technology

Artificial Intelligence Projects

Search algorithms for AI

Project Work for AI

An implementation of BFS, DFS, and A* search in Python

Implementation of BFS, DFS, USC and A-Star for Pacman food grid search.

Pacman and Ghost Agent | Python | Artificial Intelligence | Search-based Algorithms | Learning-based Algorithms

Maize puzzle solving problem implement using A* algorithm implemented in python

Gimme a maze and I will solve it!

This repo was a short term project for CSCI 4511W (Artificial Intelligence) that uses a custom implementation of Pac-Man to compare different pathfinding algorithms.

Illustration of a star algorithm work

Udacity AI Nanodegree's Project for implementing a Planning search. This project uses multiple search algorithms to solve a planning problem and then analyses the results based on certain metrics to find the best heuristic.

Automatic Pacman Game using algorithms to find the way to pass

My own take on A*/Dijkstra Pathfinding. Its a generalization to permit all implementations while using any data-structures and heuristic functions regardless of whether or not the "map" fits in memory.

In this project, the Pac-Man agent finds paths through its maze world, both to reach a particular location and to collect food efficiently. Search algorithms such as Depth First Search, Bread First Search, Uniform Cost Search and A-star search are applied to Pac-Man scenarios.

A project that applies several Artificial Intelligence techniques such as informed state space search, reinforcement learning and probabilistic inference. Algorithms such as Depth First Search, Breadth First Search, Uniform Cost Search, A-star Search enabled the pacman to win in different game versions

solving 8_puzzle in 3 method: breadth first search , depth first search and A*

A-star pathfinding with pygame visualization