Pacman and Ghost Agent | Python | Artificial Intelligence | Search-based Algorithms | Learning-based Algorithms
-
Updated
Feb 18, 2017 - Python
Pacman and Ghost Agent | Python | Artificial Intelligence | Search-based Algorithms | Learning-based Algorithms
A Gomoku-Playing AI. Using Minimax search with Alpha-Beta pruning.
Fork of the code of Pengkun Liu's Master Thesis, June 2015
A game playing agent that kicks ass in a modified version of isolation.
Term 1 Project 1 Build a Game-Playing Agent by Luke Schoen for Udacity Artificial Intelligence Nanodegree (AIND)
In this project, you will design agents for the classic version of Pacman, including ghosts. Along the way, you will implement both minimax and expectimax search and try your hand at evaluation function design.
Alpha Beta pruning Breakthrough agent
reversi_game, wedding seating Arrangement, Decision Network
A simple Python AI program with GUI that plays 4-in-a-row (or Connect 4).
Build a Game Playing Agent
This repo contains all the projects developed during my AIND journey.
Adverserial agent for isolation game
Udacity AIND - Building a game playing agent, to play a modified version of Isolation.
Breakthrough game, playing with an AI agent
My submissions for the Pac-Man projects (as part of UC Berkeley's introductory Artificial Intelligence Course, CS 188)
Halma game with an AI player, move validation, and dynamic board sizing
A simple game similar to Four in a line or Connect Four. Can also play against computer.
Multiplayer snake AI
Add a description, image, and links to the adversarial-search topic page so that developers can more easily learn about it.
To associate your repository with the adversarial-search topic, visit your repo's landing page and select "manage topics."