Assignment 2 Bonus: Master Thief

Due: 23:59:59 Wednesday 10th February No Late Submissions accepted

Worth: 2 marks

Assignment 2 Bonus Challenge Tasks

1. Task 0: Makefile - 0 Marks (but mandatory - you will receive 0 for automarking if it is missing)

   Complete a Makefile for the bonus component of the assignment.

   It should be capable of producing:

   File name	Comment
   assn2Bonus	Client program

   We will be using your makefile to compile your assignment for automarking, so if you do not provide one you will receive 0 for the automarking. Also make sure your Makefile produces executables with the same name as given above. eg assn2Bonus

2. Task 1: Thief Strategy Implementation - 2 Marks

   You must modify the assn2 program and implement a strategy for the thief.

   Assume the thief has a map of the cities and knows where the getaway location is. Also assume that the thief knows the location of each detective, but does not know the strategy or stamina of the agent. Also assume that for this part of the assignment no detectives will be using random strategy. The thief does not know where the informants for the detectives are.

   The aim is to implement a clever strategy for the thief that increases the liklihood of getting away, or at least holding off being caught for as long as possible.

3. Diary: 0 Marks (but you lose 1 mark if it is missing)You must maintain an assn2Diary.txt file. You will need to provide an entry in an assn2BonusDiary to explain your strategy and the basics of how it works.

Assessment of assn2Bonus

This will be run as a competition.

All entries, along with the original random thief from the assn2Model will be run in different situations.

Different situations will include different maps, different starting locations, different seeds, different detective strategies etc.

Any submissions that do not follow the rules of the game will be disqualified. If they seem like a serious attempt that unintentionally broke the rules, they will get 0.5 marks, but will not be run during the competition.

During the competition, the number of times the thief gets away will be recorded. The number of times the thief is caught will also be recorded, along with as the number of hours the thief can resist being caught by the detectives in situations when the thief gets caught or time runs out..

The score is calculated by the number of getaways minus the number of times the thief is caught.

The person with the highest score wins. In cases of ties, the total number of hours the thief resisted being caught will be taken into account.

Marks

Marks will be given as follows:

1. Winner 2/2
2. Second 1.9/2
3. Third 1.8/2
4. Fourth 1.6/2
5. Fifth 1.5/2

• Any other entries that can beat the Random Thief will be given a score of 1

• Any other serious attempts that do not beat the Random Thief will get 0.5

Originality of Work

ALL work submitted for this assignment MUST BE YOUR OWN WORK and it MUST BE COMPLETED INDIVIDUALLY. DO NOT COPY FROM OTHERS; DO NOT ALLOW ANYONE TO SEE YOUR CODE. We regard copying of assignments, in whole or part, as a serious offence. We use plagiarism detection software to search for multiply-submitted work and work that is similar to programs found on the internet and other sources. Be warned that:

• the submission of work derived from another person, or jointly written with someone else will, at the very least, result in automatic failure for COMP1927 with a mark of zero. allowing another student to copy from you will, at the very least, result in a mark of zero for your own assignment; and
• severe or second offences will result in automatic failure, exclusion from the University, and possibly other academic discipline.
• Group submissions will not be allowed. Your program must be entirely your own work.

• Learning Centre: Plagiarism and Academic Integrity
• MyUNSW: Plagiarism and Academic Misconduct
• CSE: Addendum to UNSW Plagiarism Guidelines
• CSE: Yellow Form (whose terms you have agreed to)

Submission

1927 classrun 16x1 give assn2Bonus *.c *.h Makefile assn2BonusDiary.txt