This repo contains our work on Udacity's Artificial Intelligence Nanodegree Projects.
In this introductory project, we use constraint propagation to find solutions to Sudoku puzzles, repeatedly applying game rules (constraints) until the Sudoku puzzle stops changing.
For more information about this project, go here.
This game-playing agent uses techniques such as iterative deepening, Minimax, and Alpha-Beta Pruning to beat its opponent in a game of Isolation (a two-ply discrete competitive game with perfect information).
For details about our implementation, please visit this link.
For this project, we implement a planning search agent to solve deterministic logistics planning problems for an Air Cargo transport system. We use a planning graph and automatic domain-independent heuristics with A search* and compare their results/performance against several uninformed non-heuristic search methods (breadth-first, depth-first, etc.).
Additional details can be found here.
If you have any questions about this work, please feel free to contact us here:
