#787 · Primary category: Education & Research

stanford-cs-221-artificial-intelligence

a-star artificial-intelligence bayesian-networks cheatsheet constraint-satisfaction-problem data-science markov-decision-processes

VIP cheatsheets for Stanford's CS 221 Artificial Intelligence

Project last updated:12/17/19

GitHub Stars

3.0K

Forks

566

Contributors

2

License

MIT

Why we included this project

Anyone working through an AI course will get real mileage from this collection of dense reference sheets. Each one condenses a major block of Stanford's CS 221 curriculum, such as search, game playing, Markov decision processes, constraint satisfaction, Bayesian networks, and logic, into a page or two you can skim before an exam or when you need to refresh a topic between projects. The sheets are grouped by model type, and a combined super cheatsheet gathers everything into a single document for quick revision. Versions exist in English, French, and Turkish, so instructors and non-native speakers have some room to choose. It is study material rather than runnable software, but for students, teaching assistants, or self-learners who want a compact map of the fundamentals, it works well alongside a textbook or lecture notes.

Articles for this project

No articles for this project yet.

To suggest a topic or contribute an article, contact us.

Related projects in this category