COMP1100 Assignment 2 HighLife

In this assignment, you will write code to explore some simple computational models called Cellular Automata. A Cellular Automaton consists of a grid of cells and a rule that describes how cells change over discrete time steps. These can be used to model all sorts of interesting things, like biological systems, electronics and liquids. For this assignment, you will be modelling the cellular automaton HighLife.

This assignment is worth 17% of your final grade.

Deadline: Sunday 19th May, 2024, at 11:00pm Canberra time sharp.

Overview of Tasks

This assignment is marked out of 100 for COMP1100, and out of 120 for COMP1130:

From this assignment onward, code that does not compile and run will be penalised heavily. This means that both the commands cabal v2-run automata and cabal v2-test must run without errors. If either if those commands fail with an error, a heavy mark deduction will be applied. If you have a partial solution that you cannot get working, you should comment it out and write an additional comment directing your tutor’s attention to it.

Getting Started

Fork the assignment repository and clone it to your computer, following the same steps as in Lab 2. The assignment repository is at https://gitlab.cecs.anu.edu.au/comp1100/2024s1/2024s1studentfiles/comp1100-2024s1-ass2.

Overview of the Repository

For COMP1100 students, most of your code will be written in src/Automata.hs, and a little in src/TestPatterns.hs. You will also need to implement tests in src/AutomataTest.hs, which contains some example tests for you to study. COMP1130 students will also need to write code in src/App.hs.

Other Files

• src/TestPatterns.hs contains some test patterns for the automata in this assignment.

• src/Testing.hs is the testing library we used in Assignment 1. You should read this file as well as src/AutomataTest.hs, and make sure you understand how to write tests.

• src/GridRenderer.hs contains code to render a grid of cells to the screen, and to convert a point on the screen back into a grid coordinate. You are not required to understand it, but it is commented for interested students to read.

• src/App.hs contains the bulk of a small CodeWorld test program that uses your automata code. Its features are discussed in “Overview of the Test Program”.

• app/Main.hs launches the test application.

• test/Main.hs is a small program that runs the tests in src/AutomataTest.hs.

• comp1100-assignment2.cabal tells the cabal build tool how to build your assignment. You are not required to understand this file. We will discuss how to use cabal below.

• Setup.hs tells cabal that this is a normal package with no unusual build steps. Some complex packages (that we won’t see in this course) need to put more complex code here. You are not required to understand it.

Overview of Cabal

As before, we are using the cabal tool to build the assignment code. The commands provided are very similar to last time:

• cabal v2-build: Compile your assignment.

• cabal v2-run automata: Build your assignment (if necessary), and run the test program.

• cabal v2-repl comp1100-assignment2: Run the GHCi interpreter over your project.

• cabal v2-test: Build and run the tests. This assignment is set up to run a unit test suite like in Assignment 1, but this time you will be writing the tests. The unit tests will abort on the first failure, or the first call to a function that is undefined.

You should execute these cabal commands in the top-level directory of your project: ~/comp1100/assignment2 (i.e., the directory you are in when you launch a terminal from VSCodium).

Overview of the Test Program

The test program in app/Main.hs uses CodeWorld, just like Assignment 1, and responds to the following keys:

You can also click on cells with the mouse to change them, if you want to play around with different patterns.

If you try to use the test program without completing Task 1, or you try to run the simulation before completing Task 2, the test program may crash with the following error:

"Exception in blank-canvas application:"
Prelude.undefined

If this happens, refresh the browser to continue.

Overview of Cellular Automata

A cellular automaton is a simulation made up of a grid of cells. The simulation proceeds in discrete time-steps: to compute the next generation of the simulation, we apply a rule to each cell that looks at itself and its neighbourhood (the set of its eight immediate neighbours - up, down, left, right, and the diagonals) and returns what the new cell should be.

In this assignment, you will be implementing an automaton called HighLife. This is a variant of the classic cellular automaton Game of Life: Conway’s Game of Life.

HighLife

Conway’s game of life is a classic cellular automaton, and probably the one most people think of when they hear the phrase. There are many interesting variants of the Game of Life. HighLife is one of these variants.

The rule for the HighLife variant of the Game of Life is:

• Cells can be alive or dead.
• If a cell is alive:
  • If either exactly two or exactly three of its neighbours are alive, it remains alive.
  • Otherwise, it becomes dead.
• If a cell is dead:
  • If either exactly three or exactly six of its neighbours are alive, it becomes alive.
  • Otherwise, it remains dead.

These rules produce a kaleidoscope of interesting patterns and behaviours.

Test Patterns

Test Pattern 1 is called a replicator. It produces interesting patterns by creating copies of itself along a diagonal line. More information about this pattern is here.

Test Pattern 2 is a pattern that ends after a certain number of steps.

Test Pattern 3 is a pattern involving several parts, which interfere with each other as they evolve.

Task 1: Types and Helper Functions (COMP1100: 20 Marks; COMP1130: 20 Marks)

Before we can begin implementing the rules for our cellular automata, we need to set up a few things:

1. Data types to represent each sort of cell;
2. Helper functions over cells; and
3. Helper functions for our Grid data type.

The assignment framework will use these functions to render entire grids of cells to CodeWorld Pictures.

Your Tasks

1.1) In src/Automata.hs, complete the data type Condition that represents the state of cells in HighLife, either Alive or Dead. Defining our own type to talk about cells lets us be precise when we code, which reduces bugs.

1.2) In src/TestPatterns.hs, there are three test patterns for HighLife, expressed as Strings. The parseGrid function parses these strings into values of type Grid, which are made available to the rest of the program. (Parsing is the process of analysing unstructured data - usually strings or binary data - and converting it into a more structured form.)

parseGrid relies on a helper function to parse individual characters into cells. For HighLife, the helper is toCondition :: Char -> Condition, which you need to implement. It should turn a character from a test pattern into a cell, according to the following rule:

• An 'a' character represents an alive cell.
• Any other character represents a dead cell.

1.3) We provide a test program that uses CodeWorld to draw the cells to the screen, and allows you to edit the grid by clicking on it. It relies on some helper functions in src/Automata.hs, which you need to implement:

a) The test program allows the user to change cells by clicking on them. This relies on cycleCondition :: Condition -> Condition, which returns what the cell should be after it is clicked. This function needs to return the “next” type of condition. The “next” of an alive cell is a dead cell, and the “next” of a dead cell is an alive cell.

b) The test program knows how to draw a Grid of cells, provided that it can be told how to draw a single cell from the grid. It uses renderArea :: Grid a -> Condition -> Picture to do this, which needs to behave according to the following rules:

• Cells should be drawn as solid, coloured rectangles, centered at the origin (i.e. not translated).

  The overall width of the grid of Cells is given by paneWidth and the overall height of the grid is given by paneHeight.

  The width of a single cell should be given by dividing the width of the whole grid by the number of cells in each row. Similarly, the height should be the height of the whole grid divided by the number of rows.

• The colour of each Cell should be determined by its condition. A dead cell should be blue and an alive cell should be yellow.

1.4) The test program requires two more helpers in src/Automata.hs that deal with the grid as a whole. You might also find them useful in Task 2:

a) get :: Grid Condition -> AreaCoord -> Maybe Condition

• The test program uses get when it responds to mouse clicks, to find the cell that the user is changing.

• get g (x,y) should return Just the cell at position (x,y), if it exists. If it does not (i.e., x or y are outside the bounds of the Grid), it should return Nothing.

• Both x and y count from 0. That is, (0,0) is the top-left corner of the grid.

• The cells in a Grid are stored as a single list, in what we call row-major order. This means that the list contains every cell in row 0, then every cell in row 1, then every cell in row 2, and so on…

b) allCoords :: Grid a -> [AreaCoord]

allCoords (Grid nrows ncolumns _) should return a list of every possible coordinate in a grid of that width and height, in row-major order. It is important that you emit coordinates in this order, as the assignment skeleton assumes that the list of cells in a grid is stored in the same order. The renderer in the test program uses allCoords to decide where to place the Picture of each cell in the grid.

Both width and height must be positive integers to return a sensible result. Raise an error if either are zero or negative.

• Example: allCoords (Grid 2 3 []) shall return [(0,0),(1,0),(2,0),(0,1),(1,1),(2,1)].

Hint

• The function (!!) :: [a] -> Int -> a can return the nth element of a list:

  • Example: ['a', 'b', 'c'] !! 2 returns 'c'.

  • Example: [] !! 0 throws an error, as the index is beyond the length of the list.

  • You don’t want to use this function often (because of the risk of errors), but it is a handy tool here.

Task 2: Running Cellular Automata (COMP1100: 25 Marks; COMP1130: 25 Marks)

We can now render the cellular automata grids in CodeWorld. The next step is to make them evolve according to the HighLife rules.

Your Task

2.1) Define the following two functions in src/Automata.hs:

• updateGrid :: Grid Condition -> Grid Condition computes the next generation of HighLife according to its rule; and

• multiSteps :: Grid Condition -> Int -> Grid Condition, which evolves the grid a given number of times. If given a negative number, multiSteps shall raise an error.

Hints

• Break the problem down into subproblems (separate functions), and test each in isolation. If you find a function does not do what you expect, you will have smaller units of code to debug. This will make it easier for you to understand it.

• Here are some questions you might need to ask when formulating a solution; some of them could be turned into helper functions:

  • Given a coordinate for a cell on a grid, what is its neighbourhood (the eight cells around that coordinate: one step up, down, left, right, and the diagonals)?

    Style Note: You can split complex expressions over multiple lines, for readability:

    -- This calculation is pointless but long.
    -- Instead of writing it out like this:
    fiveFactorials = [1, 1 * 2, 1 * 2 * 3, 1 * 2 * 3 * 4, 1 * 2 * 3 * 3 * 5]
    
    -- Why not write it out like this?
    fiveFactorials =
      [ 1
      , 1 * 2
      , 1 * 2 * 3
      , 1 * 2 * 3 * 4
      , 1 * 2 * 3 * 3 * 5
      ]
    
    -- P.S.: Did you notice the bug?
    -- It's easier to see in the second example, isn't it?
    

  • Given a neigbourhood, how many cells are of some particular type?

  • Given a cell and its neighbourhood, what will the next cell look like?

• Do the helper functions from Task 1 solve any of your subproblems?

• The list of cells within a Grid c is in row-major order. The list of co-ordinates returned by allCoords is in row-major order. Can you do anything useful by using both simultaneously?

Task 3: Undo Operation Using a Stack (COMP1100: 15 Marks; COMP1130: 15 Marks)

A stack data structure can be useful for creating an undo operation.

Your Task

3.1) Complete the push and pop operations of the stack data structure given in src/CAStack.hs:

• push :: CAStack a -> a -> CAStack a should push the given data item to the given stack.

• pop :: CAStack a -> (Maybe a, CAStack a) should pop the top item from the stack and return a pair containing the popped item and the new stack. If the original stack is empty, it should return Nothing and an empty stack.

3.2) In src/App.hs, the function parseEvent links the key press of Z with the UndoPress event. The event is handled in the function applyEvent. Your task is to write the code for UndoPress so that it reverses the effect of clicking a cell in the grid.

When a user clicks a cell, it is handled by the ChangeArea event, which uses at p cycleCondition grid to apply the function cycleCondition to the cell at position p. Similarly, you will need to use the at function to apply a function which does the reverse of cycleCondition. You do not need to change the at function and it is not necessary to understand how it works. All you need to know is that it takes an AreaCoord (the position), a function to change between conditions and a grid and returns a new grid with the cell at the given position changed according to the given function.

When writing the code for UndoPress, it might be easier to use a separate function rather than trying to write all the code in one line as was done for the ChangeArea case.

Hint:

This is where the stack is used. How will you find what location you want to reverse? For the ChangeArea case, the p is the position that the user has just selected, but for UndoPress, you need to get the last position that the user selected. How can the stack data structure help you? Also, remember that the pop operation of CAStack returns a pair. You’ll have to handle the case where the pop returns Nothing as the first item in the pair, vs. when it returns a data item. This is why a separate function could make things easier.

In order for you to use pop to find the last position, you need some way of pushing it in the first place. The Model data type in src\App.hs has several parameters. The last one is a CAStack. This is what you can use to achieve your goal. Notice that in the code for handling ChangeArea in applyEvent, when creating a new Model, it just passes the same CAStack that was in the Model that was given as a parameter to applyEvent:

Model n steps (at p cycleCondition grid) castack (The last parameter castack is the same CAStack unchanged.)

How could you change this code so that it pushes the latest point that a user has clicked to the stack?

The UndoPress event should only undo up to the last time that the model moved to a new step, i.e. when the user last pressed the space bar or full stop. This has been handled for you, by passing EmptyStack as the last parameter for the Model in the Step and Jump cases.

If your code is correct, you should be able to click a few cells and then press Z to undo the changes.

Task 4: Custom Automaton (COMP1130 Only: 20 Marks)

For this task, you are required to create another cellular automaton that is either a complex variant of the Game of Life (see below for details) or is some other cellular automaton that contains additional properties.

Your Task

There are many variants of the Game of Life. See for example: list at Stanford some interesting variants and more variants.

Your task is to model a variant that has a feature which requires significant additional code, i.e. you will not receive any marks for making a variant that only changes the numbers in the rules, e.g. an Alive cell staying alive if there are a different number of alive neighbours, compared to the 2 or 3 neighbours required in HighLife. This will be insufficient for you to receive marks for this task. The following are some examples of what would be a suitable variant:

• A variant which has a rule involving keeping track of how long (how many steps) a cell has been in a particular state. An example is the Generations variant. However, you should implement it by somehow storing the information on how many steps each cell has been in a state, not by just adding a rule to make a cell go to a third state one step after being Alive.

• A variant such as the Rainbow Game of Life, where a cell takes a colour based on the average of the colours of surrounding cells. This requires storing the new average colour of the cells, rather than just the fixed values of Alive and Dead.

Feel free to invent other variants, as long as it contains some more complex aspect that will require a change to the data types of cells and additional functionality in the code.

• A cellular automata model of something else, such as an environment process. For example, the spread of flood water or fire. It should contain some aspect that needs to be stored along with the state of the cell, e.g. a value that causes the cells to behave differently depending on the values of neighbours as well as their states.

You will need to do all of the following:

• Define a data type for the cells. Traditional cellular automata tend to use enumerations for the cell type, but you are free to use the full power of Haskell’s algebraic data types where that makes sense in your simulation.

• Define a rule for your automaton, which should consider only the current cell and its neighbours. The rules for the Game of Life and HighLife consider the cells in a neighbourhood without regard to direction, but your variant might perform different behaviour depending on the directions of neighbouring cells.

• Define a function that computes the next generation of your automaton.

• Define a function that evolves your automaton an integer number of steps.

• Define a rendering function for your cell type, similar to the one for HighLife.

• Define two test patterns in src/TestPatterns.hs for your automaton.

• Make all of the above work with the test program in src/App.hs. The user needs to be able to:

  • Use the keyboard to switch between HighLife and your automaton;
  • Select either of your test patterns, using the existing key bindings;
  • Advance one step at a time by pressing .;
  • Jump forward multiple steps using <Spacebar>; and
  • Change the grid by clicking on it (you can decide what’s sensible here - toggling cells made sense for HighLife, but might not for your automata, especially if it has more than 2 states).

• Discuss your automaton in your report, making sure to explain how it models your chosen process/system. This is very important, as it will help your marker to understand your intention.

Hints

• When handling the case for clicking a cell in applyEvent, use either at or setAt to “update” the grid at one particular cell.

• When making large changes like this, you can often “follow the types”. This is a useful procedure for making changes in strongly-typed languages like Haskell: make a change to a type and then repeatedly attempt to build your program. GHC will issue type errors and warnings which tell you where the problems are in the rest of your code. As you fix those, and rebuild, you will “push” the errors out of your program.

Unit Tests (COMP1100: 10 Marks; COMP1130: 10 Marks)

How do you know that the program you’ve written is correct? GHC’s type checker rejects a lot of invalid programs, but you’ve written enough Haskell by now to see that a program that compiles is not necessarily correct. Testing picks up where the type system leaves off, and gives you confidence that changing one part of a program doesn’t break others. You have written simple doctests in your labs, but larger programs need more tests, so the tests you will write for this assignment will be labelled and organised in a separate file from the code.

Open src/AutomataTest.hs. This file contains a couple of example test cases, written using a simple test framework defined in src/Testing.hs. These files are heavily commented for your convenience.

You can run the tests by executing cabal v2-test. If it succeeds it won’t print out every test that ran, but if it fails you will see the output of the test run. If you want to see the tests every time, use cabal v2-test --test-show-details=streaming instead.

Your Task

Replace the example tests with tests of your own. The tests that you write should show that the Haskell code you’ve written in Tasks 1-3 is working correctly.

Hints

General Hints

• Try writing tests before you write code. Then work on your code until the tests pass. Then define some more tests and repeat. This technique is called test-driven development.

• The expected values in your test cases should be easy to check by hand. If the tested code comes up with a different answer, then it’s clear that the problem is with the tested code and not the test case.

• Sometimes it is difficult to check an entire structure that’s returned from one of your functions. Maybe you can compute some feature about your result that’s easier to test?

• If you find yourself checking something in GHCi (i.e., cabal v2-repl comp1100-assignment2), ask yourself “should I make this into a unit test?”. The answer is often “yes”.

• If you are finding it difficult to come up with sensible tests, it is possible that your functions are doing too many things at once. Try breaking them apart into smaller functions and writing tests for each.

Technical Hints

• The assertEqual and assertNotEqual functions will not work on the CodeWorld Picture type (it has no Eq instance). Therefore, it is not possible to write tests for renderGrid.

• If you want to write tests about new types you have defined, add deriving (Eq, Show) to the end of the type definition, like this:

  data MyType = A | B | C deriving (Eq, Show)

• It is not possible to test for a call to error using the tools provided in this course.

Style (COMP1100: 10 Marks; COMP1130: 10 Marks)

“[…] programs must be written for people to read, and only incidentally for machines to execute.”

From the foreword to the first edition of Structure and Interpretation of Computer Programs.

Programming is a brain-stretching activity, and you want to make it as easy on yourself as possible. Part of that is making sure your code is easy to read, because that frees up more of your brain to focus on the harder parts.

Guidance on good Haskell style can be found in this course’s Style Guide, and in lecture notes.

Your Task

Ensure that your code is written in good Haskell style.

Technical Report (COMP1100: 20 Marks; COMP1130: 20 Marks)

You are to write a concise technical report about your assignment.

The maximum word count is 1250 for COMP1100 students, and 2000 for COMP1130 students. This is a limit, not a quota; concise presentation is a virtue.

Once again: This is not the number of words that you have to write. They are the maximum number of words that your marker will read. If you can do it in fewer words without compromising the presentation, please do so.

Your report must be in PDF format, located at the root of your assignment repository on GitLab and named Report.pdf. Otherwise, it may not be marked.

The report must have a title page with the following items:

• Your name
• Your laboratory time and tutors
• Your university ID

An excellent report will:

• Demonstrate a conceptual understanding of all major functions, and how they interact when the program as a whole runs;

• Explain your design process, including your assumptions, and the reasons behind choices you made;

• Discuss how you tested your program, and in particular why your tests give you confidence that your code is correct; and

• Be well-formatted without spelling or grammar errors.

Content and Structure

Your audience is the tutors and lecturers, who are proficient at programming and understand the concepts taught in this course. You should not, for example, waste words describing the syntax of Haskell or how recursion works. After reading your technical report, the reader should thoroughly understand what problem your program is trying to solve, the reasons behind major design choices in it, as well as how it was tested. Your report should give a broad overview of your program, but focus on the specifics of what you did and why.

Remember that the tutors have access to the above assignment specification, and if your report only contains details from it then you will only receive minimal marks. Below is a potential outline for the structure of your report and some things you might discuss in it.

Introduction

If you wish to do so you can write an introduction. In it, give:

• A brief overview of your program:

  • how it works; and
  • what it is designed to do.

Content

Talk about why you structured the program the way you did. Below are some questions you could answer:

• Program design
  • Describe what each relevant function does conceptually. (i.e. how does it get you closer to solving the problems outlined in this assignment spec?)
  • How do these functions piece together to make the finished program? Why did you design and implement it this way?
  • What major design choices did you make regarding the functions that you’ve written, and the overall structure of your program?
• Assumptions
  • Describe any assumptions that you needed to make, and how they have influenced your design decisions.
• Testing
  • How did you test individual functions?
    • Be specific about this - the tutors know that you have tested your program, but they want to know how.
    • Describe the tests that prove individual functions on their own behave as expected (i.e. testing a function with different inputs and doing a calculation by hand to check that the outputs are correct).
  • How did you test the entire program? What tests did you perform to show that the program behaves as expected in all (even unexpected) cases?
  • Again, be specific - did you just check that you can draw the triangles and polygons from Task 1, or did you come up with additional examples?
• Inspiration / external content
  • What resources did you use when writing your program (e.g., published algorithms)?
  • If you have used resources such as a webpage describing an algorithm, be sure to cite it properly at the end of your report in a ‘References’ section. References do not count to the maximum word limit.

Reflection

Discuss the reasoning behind your decisions, rather than what the decisions were. You can reflect on not only the decisions you made, but the process through which you developed the final program:

• Did you encounter any conceptual or technical issues?
  • If you solved them, describe the relevant details of what happened and how you overcame them.
  • Sometimes limitations on time or technical skills can limit how much of the assignment can be completed. If you ran into a problem that you could not solve, then your report is the perfect place to describe them. Try to include details such as:
    • theories as to what caused the problem;
    • suggestions of things that might have fixed it; and
    • discussion about what you did try, and the results of these attempts.
• What would you have done differently if you were to do it again?
  • What changes to the design and structure you would make if you wrote the program again from scratch?

• Are parts of the program confusing for the reader? You can explain them in the report (in this situation you should also make use of comments in your code).

• If you collaborated with others, what was the nature of the collaboration? (Note that you are only allowed to collaborate by sharing ideas, not code.)
  • Collaborating is any discussion or work done together on planning or writing your assignment.
• Other info
  • You may like to briefly discuss details of events which were relevant to your process of design - strange or interesting things that you noticed and fixed along the way.

This is a list of suggestions, not requirements. You should only discuss items from this list if you have something interesting to write.

Things to avoid in a technical report

• Line by line explanations of large portions of code. (If you want to include a specific line of code, be sure to format as described in the “Format” section below.)
• Pictures of code or VSCodium.
• Content that is not your own, unless cited.
• Grammatical errors or misspellings. Proof-read it before submission.
• Informal language - a technical report is a professional document, and as such should avoid things such as:
  • Unnecessary abbreviations (atm, btw, ps, and so on), emojis, and emoticons; and
  • Recounting events not relevant to the development of the program.
• Irrelevant diagrams, graphs, and charts. Unnecessary elements will distract from the important content. Keep it succinct and focused.

If you need additional help with report writing, the academic skills writing centre has a peer writing service and writing coaches.

Format

You are not required to follow any specific style guide (such as APA or Harvard). However, here are some tips which will make your report more pleasant to read, and make more sense to someone with a computer science background.

• Colours should be kept minimal. If you need to use colour, make sure it is absolutely necessary.
• If you are using graphics, make sure they are vector graphics (that stay sharp even as the reader zooms in on them).
• Any code, including type/function/module names or file names, that appears in your document should have a monospaced font (such as Consolas, Courier New, Lucida Console, or Monaco)
• Other text should be set in serif fonts (popular choices are Times, Palatino, Sabon, Minion, or Caslon).
• When available, automatic ligatures should be activated.
• Do not use underscore to highlight your text.
• Text should be at least 1.5 spaced.

Communication

Do not post your code publicly, either on Ed or via other forums. If by mistake you post your code publicly, others will have access to your code and you may be held responsible for plagiarism.

Once again, and we cannot stress this enough: do not post your code publicly . If you need help with your code, post it privately to the instructors.

When brainstorming with your friends, do not share code and do not share detailed descriptions of your design. There might be pressure from your friends, but this is for both your and their benefit. Anything that appears to be plagiarism will be investigated and there may be serious consequences.

Course staff will not look at assignment code unless it is posted privately on Ed or shown at a drop-in consultation.

Course staff will typically give assistance by asking questions, directing you to relevant exercises from the labs, or definitions and examples from the lectures.

Before the assignment is due, course staff will not give individual tips on writing functions for the assignment or how your code can be improved. We will help you get unstuck by asking questions and pointing you to relevant lecture and lab material. You will receive feedback on you work when marks are released.

Submission Advice

Start early, and aim to finish the assignment several days before the due date. At least 24 hours before the deadline, you should:

• Re-read the specification one final time, and make sure you’ve covered everything.

• Confirm that the latest version of your code has been pushed to GitLab by using your browser to visit https://gitlab.cecs.anu.edu.au/uXXXXXXX/comp1100-2024s1-ass2, where XXXXXXX is your student number.

• Ensure your program compiles and runs, including the cabal v2-test test suite.

• Proof-read and spell-check your report.

• Verify that your report is in PDF format, in the root of the project directory (not in src), and named Report.pdf. That capital R is important - Linux uses a case-sensitive file system. Check that you have successfully added it in GitLab.