Developing AI search agents to win Pacman.
-
Updated
Mar 21, 2019 - Python
Developing AI search agents to win Pacman.
Pacman Projects 1,2,3 of Brekley course cs188. These are 3 of 4 code assignments I was assigned in my Junior year in the course "AI" (YS02) at the University of Athens.
These are the Pac-Man projects involving design and implementation of various AI & ML techniques for which complete description and base code files is made available at http://ai.berkeley.edu/project_overview.html by Dan Klein, Pieter Abbeel and others. This project along with the complete course was adapted by our professor here at University o…
The aim of this project is to provide a solution for a Pacman exercise
Projects of the artificial intelligence course @ CentraleSupelec
Design and Implementation of Random Forest algorithm from scratch to execute Pacman strategies and actions in a deterministic, fully observable Pacman Environment.
Solutions to projects 1 and 2 of Berkeley's Pacman
Implement DFS, BFS, UCS, and A* algorithms && minimax and expectimax algorithms, as well as designing evaluation functions
A simple PACMAN game developed in Borland C Graphics lib. (code copied from web)
Project for the C++ BSc AUEB course
AI Course Projects - Fall 2022
Explore foundational AI concepts through the Pac-Man projects, designed for UC Berkeley's CS 188 course. Implement search algorithms, multi-agent strategies, and reinforcement learning techniques in Python, emphasizing real-world applications. Engage in the Eutopia Pac-Man contest for a multiplayer capture-the-flag challenge
Pacman and Ms. Pacman reverse engineered in JavaScript
UC Berkeley Pacman AI Projects
A Monte-Carlo Tree Search mathod that enables two agents interact and work together in the game of Pacman Capture the Flag.
A dynamic and enhanced version of the classic Pac-Man game implemented in Java 17.0.2. This project features randomly generated mazes, unique behaviors for Pac-Man and four types of ghosts, diverse power-ups, and distinct themes for each of the ten game levels.
Berkeley Pacman Projects (1 and 2), Depth First Search, Breadth First Search, Uniform Cost Search ,A* Search , Heuristic Functions ,Suboptimal Search, Minimax Algorithm, Alpha-Beta Pruning, Expectimax, Constraint Santisfaction Problems, RLFA CSP problem, Propositional Logic, First-order Logic
Contains a few projects I completed while taking the Intro to AI course
Add a description, image, and links to the pacman-projects topic page so that developers can more easily learn about it.
To associate your repository with the pacman-projects topic, visit your repo's landing page and select "manage topics."