Solutions to the Nanodegree's projects.
Using constraint propagation and depth first search.
Using the minimax algorithm with alpha-beta pruning.
Using 'Breadth First Search', 'Uniform Cost Search' and 'A* Search'.
Using 'Simulated Annealing' to approximate a solution.
Using 'Constraint Satisfaction'.
Using 'State Space Planning', 'Partial Order Planning' and 'Planning Graphs'.
Using 'Hidden Markov Models'.
Using 'Convolutional Neural Networks'.
Using 'Recurrent Neural Networks'.