The hero is lucky to have so much information about this dungeon! But they are not that lucky. The corridors can collapse, the keys are scattered, and it’s not so easy to figure out a path through the dungeon. Nonetheless, there’s treasure at the end!! The hero can perform any of the following actions:

1.     The hero can move to an adjacent room (connected to a common corridor as the current room) as long as the corridor is not locked and is not collapsed. The corridors with a red lock are risky and    will collapse once passed (i.e., can only be passed once). If they move into a room through a risky  corridor, then the destination room becomes “messy” with rubble.

2.     When holding the correctly coloured key, the hero can unlock a corridor it is adjacent to (i.e., to open a blue lock, the hero must be holding the blue key).

a)     1-use keys can only be used once.

b)     2-use keys can only be used twice.

c)     Multi-use keys can be used any number of times.

d)     “Used up” keys do not disappear, but rather remain with the hero.

3.     The hero can pickup a key in their current room if they aren’t already holding a key and the room isn’t messy.

4.     The hero can drop a key they are holding, and it will then be in the current room.

5.     The hero can clean any messy room that they are currently in (making it not messy).

Important: please read and reread the above until you understand it completely. Failing to understand the domain will significantly hamper your ability to succeed on this assignment!

The Problems

The problems you need to implement are defined by the following graphs using the following legend:

Problem 1

Problem 2

Problem 3

Deliverable & Rubric

PDDL templates will be provided for the domain and problem instances. You will fill these out and submit them for this assignment. Types, constants, objects, and some of the actions will be given. You are responsible for the predicates, action preconditions/effects, initial state, and goal state for the domain and problem files. The first three problems are provided visually above. The final element is to create your own problem file / setting, and ensure that it has the following properties:

1.   The number of rooms is between 6 and 9

2.   The minimum number of move actions required is greater than 20

3.   There is a locked corridor of every colour

In order to hand in this assignment, place your domain file and 4 problem files in a zip folder along with a .docx file, a .txt file, or a .pdf file containing the list of students who worked on the project, their student numbers, NetIDs, and a short description of who contributed what. Upload this .zip file to the   assignment page on OnQ.

This assignment is worth 6% of your final grade in this course. Marks for this assignment will be distributed as follows:

•    Correct encoding of the domain (i.e., the actions). 3.5% (1% for move and unlock actions; .5% for pick-up, drop, and clean)

•    Correct encoding of each problem. 1.5% (0.5% per problem)

•    Newly provided “difficult” problem. 0.5%

•    Readability of submitted PDDL (indentation, comments, etc). 0.5%

•    Note that while you’ll need to create your own fluents, the correctness of these will be assessed as part of the action PDDL you write – there may be several ways to model things.

•   The assignment is due on February 26th .

Extra notes to remember:

•    You can only use the negative preconditions/effects, and conditional effects (i.e. you cannot use forall, exists, or, imply, etc. You can use not and and)

•    Use the given corresponding key numbers and colours provided by the figure for each problem.