First homework: Searching
This homework is due on Thursday, October 13, before midnight, via
email.
Your first task for this assignment is to choose an appropriate
problem to attack. All problems presented by Bol & Cedvall (from
Uppsalla Universitet) are valid options. The breve/quidditch problem we
have talked about in class is also valid (files for this homework will be made available next week). You can suggest to me other
problems, if you want, but it's important that you clear other possible
problems with me before you get started.
Once you have a task, you need to implement a search for it which uses
heuristics. This can be an A-Star search, an expanding beam search, a
minimax search, or another type of search appropriate for your chosen
problem. Whatever you choose, it needs to use heuristics, even if
looking at all the states is feasable.