Amazing content, thank you so much for sharing. You definitively have to find a way to include the speaker on the slides or next to them, but far smaller for the viewing to be comfortable :)
Done > Fixed the bug in upper timestamps: 00:00 Setup [no content] 03:33 Announcements [outdated] 07:31 AI Research at Berkeley [no content] 09:34 Reflex Agents 14:46 Planning Agents 17:53 Search Problem Definition 22:23 State Spaces 32:58 State Space Quiz Answer 38:04 State Space Graphs and Search Trees 43:19 Tree Search 51:07 Break [no content] 53:10 Depth-First Search 00:43 Breadth-First Search 1:03:56 DFS vs. BFS 1:08:21 Iterative Deepening 1:10:57 Uniform-Cost Search 1:18:41 Implementing Search 1:21:24 End [no content]"
I think it's because for every position, the pacman has four possible choices of the next position, and we need to include those four possiblities so that we can form a complete state graph. We have 30 coordinates, hence we have 120 state positions for the agent.
![[Live] : ONE FIGHT NIGHT 25 วันนี้!! "อเล็กซิส vs รีเกียน"](http://i.ytimg.com/vi/suVr9a6BM2g/mqdefault.jpg)
I feel smart when I laugh with them
It's like me pretending to understand jokes from big bang theory
3:33 Start
9:34 Start of content
53:10 Continue after break
Amazing content, thank you so much for sharing. You definitively have to find a way to include the speaker on the slides or next to them, but far smaller for the viewing to be comfortable :)
This is very helpful, thanks a lot.
Excellent class !
The screen size ratio is bothering me so much! Doesn't matter when the content is so awesome... But still.. you know.
all you gotta do is zoom in via browser
Done
> Fixed the bug in upper timestamps:
00:00 Setup [no content]
03:33 Announcements [outdated]
07:31 AI Research at Berkeley [no content]
09:34 Reflex Agents
14:46 Planning Agents
17:53 Search Problem Definition
22:23 State Spaces
32:58 State Space Quiz Answer
38:04 State Space Graphs and Search Trees
43:19 Tree Search
51:07 Break [no content]
53:10 Depth-First Search
00:43 Breadth-First Search
1:03:56 DFS vs. BFS
1:08:21 Iterative Deepening
1:10:57 Uniform-Cost Search
1:18:41 Implementing Search
1:21:24 End [no content]"
Do they do the JoJ in this lecture? I heard they do the JoJ in this lecture.
Why is there only 120 agent positions @30:00? Why isn't number of agent positions equal to number of pixels?
I think it's because for every position, the pacman has four possible choices of the next position, and we need to include those four possiblities so that we can form a complete state graph. We have 30 coordinates, hence we have 120 state positions for the agent.
Yes
can you please explain why the ghost position is 12?
45:49 my bookmark
1:08:52