# Summary

📗 Monday lecture: 5:30 to 8:30, Zoom Link
📗 Office hours: 5:30 to 8:30 Wednesdays (Dune) and Thursdays (Zoom Link)
📗 Personal meeting room: always open, Zoom Link
📗 Quiz (use your wisc ID to log in (without "@wisc.edu")): Socrative Link, Regrade request form: Google Form (select Q8).
📗 Math Homework: M9,
📗 Programming Homework: P4,
📗 Examples, Quizzes, Discussions: Q8,

# Lectures

📗 Slides (before lecture, usually updated on Saturday):
Blank Slides: Part 1,
Blank Slides (with blank pages for quiz questions): Part 1,
📗 Slides (after lecture, usually updated on Tuesday):
Blank Slides with Quiz Questions: Part 1,
Annotated Slides: Part 1,
📗 My handwriting is really bad, you should copy down your notes from the lecture videos instead of using these.

📗 Notes

Image by DeepNorth via Wikipedia
N/A

# Other Materials

📗 Pre-recorded Videos from 2020
Part 1 (Uninformed Search): Link
Part 2 (Breadth First Search): Link
Part 3 (Depth First Search): Link
Part 4 (Informed Search): Link
Part 5 (Uniform Cost and Greedy): Link
Part 6 (A Search): Link

📗 Relevant websites
Sheep Game: Link
Sliding Puzzle: Link
Water Jugs: Link
All Search: Link
Google Map: Link
Robot Arm: (Game) Link, (2D) Link 2, (3D) Link 3
Professor Jerry Zhu's Slides (with Proofs etc): Link


📗 YouTube videos from 2019 to 2021
How to get expansion path for BFS? Link
How to get expansion path for DFS? Link
How to get expansion path for IDS? Link
How to get expansion path for UCS? Link
How to get expansion path for BFGS? Link
How to get expansion path for A? Link
How to get expansion path for A*? Link
How to check if a heuristic is admissible? Link

# Keywords and Notations

📗 Uninformed Search
📗 Breadth First Search (Time Complexity): \(T = 1 + b + b^{2} + ... + b^{d}\), where \(b\) is the branching factor (number of children per node) and \(d\) is the depth of the goal state.
📗 Breadth First Search (Space Complexity): \(S = b^{d}\).
📗 Depth First Search (Time Complexity): \(T = b^{D-d+1} + ... + b^{D-1} + b^{D}\), where \(D\) is the depth of the leafs.
📗 Depth First Search (Space Complexity): \(S = \left(b - 1\right) D + 1\).
📗 Iterative Deepening Search (Time Complexity): \(T = d + d b + \left(d - 1\right) b^{2} + ... + 3 b^{d-2} + 2 b^{d-1} + b^{d}\).
📗 Iterative Deepening Search (Space Complexity): \(S = \left(b - 1\right) d + 1\).

📗 Informed Search
📗 Admissible Heuristic: \(h : 0 \leq h\left(s\right) \leq h^\star\left(s\right)\), where \(h^\star\left(s\right)\) is the actual cost from state \(s\) to the goal state, and \(g\left(s\right)\) is the actual cost of the initial state to \(s\).