CITS3001 AI project
-
Updated
Jun 7, 2014 - Java
CITS3001 AI project
A sliding puzzle game and solver using ncurses.
An isolation game solver.
Term 1 Project 1 Build a Game-Playing Agent by Luke Schoen for Udacity Artificial Intelligence Nanodegree (AIND)
Demos and javascript implementation of search algorithms from the book "Artificial Intelligence: A Modern Approach"
Gameplay, minmax, alpha beta pruning
project submitted at AIND (May cohort)
My projects/labs for Udacity Artificial Intelligence Nanodegree (April 2017 - present).
☁️ Simple Sokoban Solver written in Python along with AI logic implementation
Udacity AI Nanodegree's Project for a Game playing agent for Isolation. This project uses algorithms like minimax search, alpha beta pruning and iterative deepening to create a game playing agent for a zero sum board game like Isolation.
Different Searching algorithms (DFS, BFS, IDS, Greedy, A*) opting to find optimal path from source to destination
An Artificial Intelligence that beats human opponents in the game of Isolation in Python
Game-Playing Agent
an adversarial search agent to play the game "Isolation"
Connect4 game implementation and AI with MiniMax, Alpha-Beta Pruning, Iterative Deepening
Add a description, image, and links to the iterative-deepening-search topic page so that developers can more easily learn about it.
To associate your repository with the iterative-deepening-search topic, visit your repo's landing page and select "manage topics."