# udacity/artificial-intelligence

No description, website, or topics provided.
Switch branches/tags
Nothing to show
Latest commit 9b9a652 Jul 14, 2018
 Failed to load latest commit information. Exercises Jul 11, 2018 Projects Jul 14, 2018 .gitignore Apr 3, 2018 CODEOWNERS Apr 3, 2018 LICENSE Apr 3, 2018 README.md Jul 6, 2018

# Artificial Intelligence Nanodegree Program Resources

## Classroom Exercises

### 1. Constraint Satisfaction Problems

In this exercise you will explore Constraint Satisfaction Problems in a Jupyter notebook and use a CSP solver to solve a variety of problems.

Read more here

### 2. Classical Search for PacMan (only in classroom)

Please DO NOT publish your work on this exercise.

In this exercise you will teach Pac-Man to search his world to complete the following tasks:

• find a single obstacle
• find multiple obstacles
• find the fastest way to eat all the food in the map

### 3. Local Search Optimization

In this exercise, you'll implement several local search algorithms and test them on the Traveling Salesman Problem (TSP) between a few dozen US state capitals.

## Projects

### 1. Sudoku Solver

In this project, you will extend the Sudoku-solving agent developed in the classroom lectures to solve diagonal Sudoku puzzles and implement a new constraint strategy called "naked twins". A diagonal Sudoku puzzle is identical to traditional Sudoku puzzles with the added constraint that the boxes on the two main diagonals of the board must also contain the digits 1-9 in each cell (just like the rows, columns, and 3x3 blocks).

Read more here

### 2. Classical Planning

This project is split between implementation and analysis. First you will combine symbolic logic and classical search to implement an agent that performs progression search to solve planning problems. Then you will experiment with different search algorithms and heuristics, and use the results to answer questions about designing planning systems.

Read more here

### 3. Game Playing

In this project you will choose an experiment with adversarial game-playing techniques like minimax, Monte Carlo tree search, opening books, and more. Your goal will be to build and evaluate the performance of your agent in a finite deterministic two player game of perfect information called Isolation.

Read more here

### 4. Part of Speech Tagger

In this notebook, you'll use the Pomegranate library to build a hidden Markov model for part of speech tagging with a universal tagset. Hidden Markov models have been able to achieve >96% tag accuracy with larger tagsets on realistic text corpora. Hidden Markov models have also been used for speech recognition and speech generation, machine translation, gene recognition for bioinformatics, and human gesture recognition for computer vision, and more.

Read more here