| 1 | due: Wednesday 22nd January | A reading assignment. | |
| 2 | due: to be decided | A fairly simple program in Python. | |
| Read the Important Rules link above before submitting. | |||
| Quick introductions, There is a special reading assignment to get us started. Some introductory thoughts. A little problem. | ||||||
| Exploring Python. | ||||||
| Day Off | 15th | |||||
| The farmer, fox, etc, etc puzzle, a very basic but real AI solution is used. Also the Python dict (dictionary) data type is introduced, and how to make a mutable object hashable. | ||||||
| Generalising searches. Valuation and cost functions, maybe no goal state, just something good enough. Open set and closed set. Backtracking: given for free by recursion if used correctly. Sensible implementation of a queue for breadth-first search. A bit about iterative deepening. | ||||||
| Getting value from Python exceptions. Building as binary tree, first as an example, then as a demonstration of iterative deepening: Iterative deepening vastly reduces memory requirement for BFS. | ||||||
| Break | 3rd to 7th | |||||