Skip to content

↑ Year 1 · Semester 2

SC1315

Artificial Intelligence

gridworld.py

Navigation

Course

Overview

Search Strategies

1. Problem Formulation
2. State Transition Graph
3. Breadth First Search
4. Depth First Search
5. Depth Limited Search
6. Iterative Deepening
7. Bi-directional Search
8. Uniform Cost Search
9. Greedy Search
10. A* Search
11. Comparison of Searches

Adversarial Search

12. Game Trees & Backward Induction
13. Minimax Search

Reinforcement Learning

14. gridworld.py
15. Q-function
16. Hyperparameters

Contents

14 gridworld.py

14 gridworld.py

The environment is deterministic. The same action always produces the same outcome.

← Minimax Search Q-function →

Edward Lai