projects for Udacity's AI nanodegree
Project 1: Diagonal Sudoku Solver
The basic goal of the project is to get the student acquainted with the basic idea of the course and introduce to the concepts of search and constraint satisfaction
In this project we are concentrated on adversarial search and basically in Minimax , Alpha-Beta algorithms and Iterative Deepening. Also we see important it is to create a good heuristic.
Project 3: Classical Planning
The goal of the project is to understand the formulation of Planning problems in the language of PDDL, understand forward and backward State Space Search. We are also create a planning graph, the basis of GRAPHPLAN, and extract a heuristic to help is in the forward state space search.