Lab 1. Due: Friday, September 16th at 9:00 AM

Size: px

Start display at page:

Download "Lab 1. Due: Friday, September 16th at 9:00 AM"

Barnaby Rose
5 years ago
Views:

1 Lab 1 Due: Friday, September 16th at 9:00 AM Consult the Standard Lab Instructions on LEARN for explanations of Lab Days ( D1, D2, D3 ), the Processing Language and IDE, and Saving and Submitting. 1. D1 Read the Standard Lab Instructions a. Read the standard lab instructions on LEARN about Lab Days ( D1, D2, D3 ), Processing Language and IDE, and Saving and Submitting. 2. D1 Course Orientation a. Read through the Course Syllabus found on LEARN under Course Material. Refer to it for questions concerning the course, labs or assignments. b. Read Policy 71: c. Complete the Academic Integrity Tutorial and Quiz: d. The Discussion Forum for this course is on Piazza: Piazza is a great resource for getting answers to all course questions. Before asking a question, search Piazza to see of someone already asked the same question. When posting a question, always make it public so others can benefit from the answer. Confused minds think alike. Take a moment now to login and update your profile. Read your messages and follow the instructions. e. We ll be using clickers to answer short questions in class and gauge participation and comprehension. Take a moment now to register your clicker at f. g. Complete the Lab 01 Quiz quiz on Learn. CS 105 Fall 2016 Lab 1 Page 1 of 10

2 3. D2 Algorithms and Code: Programming Rush Hour Rush Hour is a puzzle game where players move a red car to an exit on the right side of a grid. The challenge is that there are other cars and trucks in the way. Players must move the other cars vertically or horizontally along spaces of the grid to make a path for the red car. You can only move vehicles forward or backward (not sideways) and they must always be on the board. Here is a link to a knockoff, online version of Rush Hour so you can see how it works (sorry it s Flash, sorry about the ads): In order to make a path for the red car to the exit, players must follow a series of steps to move the other vehicles. You should recognize this as an algorithm. You re going to write a computer program that expresses an algorithm to move the different vehicles and solve a specific starting state of the game board. NOTE: Just to be clear, you ll be using a made-up set of code that you ll type into the Processing IDE, but your program won t actually run in Processing. In our made-up programming language for playing Rush Hour, there are four different functions to move a vehicle by one square in the direction stated. moveup( ); movedown( ); moveleft( ); moveright( ); When you write your code, you replace the symbol with the name of colour of the vehicle you are trying to move. CS 105 Fall 2016 Lab 1 Page 2 of 10

3 Here are all the vehicle colour names that can be used: RED YELLOW GREEN BLUE ORANGE PURPLE TEAL Remember: since this a computer program, you have to be very precise in how you write the function and the colour name in terms of lowercase and uppercase letters. You use these functions to change the state of the game board. Let s say the game board is in State A (shown below) and you want to move the green car up one space to change the board to State B. You would write the following code in a small computer program to express this simple algorithm. Remember that computer code has a very particular syntax. The name of the function must be an exact match, even the pattern of uppercase and lowercase letters. A semicolon must be at the end of each line. State A (Starting State) State B Legal Moves: just like in real life, vehicles can only move forward or backward based on the orientation of the vehicle in the grid. This means that some function calls would result in an error. For example, calling moveup(orange) when the game is in State A would cause an error. CS 105 Fall 2016 Lab 1 Page 3 of 10

An error will also occur if a function call tries to move a vehicle off of the board like moveleft(orange). To move a vehicle multiple squares, you have to use the same function multiple times.

State B State C Now that the green car and yellow truck are out of the way and the game is in State C, you can move the red car to the exit using a special function: This command moves the red car

4 An error will also occur if a function call tries to move a vehicle off of the board like moveleft(orange). To move a vehicle multiple squares, you have to use the same function multiple times. For example, to move the yellow truck down two squares, then we would write the following program: This would change the game board from State B to State C (shown below). State B State C Now that the green car and yellow truck are out of the way and the game is in State C, you can move the red car to the exit using a special function: This command moves the red car completely through the exit if the way is clear, but if there are vehicles in the way it will crash (result in an error). Since the way was clear in State C, this function moves the game to State D and solve the puzzle. State C State D CS 105 Fall 2016 Lab 1 Page 4 of 10

5 (Solved!) You can combine these three steps into a single algorithm to solve the puzzle beginning in State A. You can express your algorithm in a single program like this: In fact, there is more than one algorithm to solve a game starting in State A. For example, this is an alternative sequence of code that will also solve the puzzle and finish in State D : Note that not all programs using these four functions are solutions, for example this will result in a crash when exitred() is called. You can even write a program that solves the game starting in State A but finishing in a different final state: movedown(green); movedown(green); CS 105 Fall 2016 Lab 1 Page 5 of 10

Below is another example program that solves the following initial puzzle state: Exercises moveleft(red); moveleft(yellow); moveleft(yellow); movedown(orange); Now that you understand the game and

6 Below is another example program that solves the following initial puzzle state: Exercises moveleft(red); moveleft(yellow); moveleft(yellow); movedown(orange); Now that you understand the game and the commands available, complete for following questions by writing code in the Processing IDE and saving each solution as a sketch. Remember, there will often be multiple algorithms that all solve the puzzle. As an extra challenge, try to find the most efficient one with the fewest steps. a. SAVE your solution to the starting state below as L1_rushhour_a CS 105 Fall 2016 Lab 1 Page 6 of 10

7 b. SAVE your solution to the starting state below as L1_rushhour_b c. SAVE your solution to the starting state below as L1_rushhour_c d. SAVE your solution to the starting state below as L1_rushhour_d CS 105 Fall 2016 Lab 1 Page 7 of 10

8 4. D2 Programming Rush Hour with Loops In the previous question, moving a vehicle multiple spaces required calling the same function multiple times. It would be nicer if we could just tell the computer to call the same function a certain number of times. We can do this using a loop command. Real Processing loops will be introduced later in the course, but for now we ll use the following simplified notation in our made-up programming language for Rush Hour. loop(n) } where you is replaced with one of the four functions to move a vehicle and you replace n with the number of times you wish to call that function. For example, instead of moving the orange car to the right five squares like this: you can create a loop instead, and write your code like this: loop(5) { } This is easier to read and easier to write. Notice the curly brackets and the way the code is indented. Code within the curly brackets is called a code block, and it defines the code that is repeated by the loop. Indentation is used to make the code more readable. Whenever there is an open curly bracket, the code that follows is indented to show the reader that that code belongs to that function. Note that as a matter of style, a loop should only be used when you wish to do a command multiple times in a row. A loop that is executed once is redundant. Here s an example using loops for the game starting in State A (the first example in part 3): CS 105 Fall 2016 Lab 1 Page 8 of 10

9 loop(2) { } Here is another example program to solve the following initial puzzle state (the same as the final example for part 3): moveleft(red); loop(4) { } loop(2) { moveleft(yellow); } movedown(orange); Exercises Rewrite your code from parts a, b, c, and d in question 3 using loops where possible. SAVE the sketches as L1_loops_a, L1_loops_b, L1_loops_c, and L1_loops_d CS 105 Fall 2016 Lab 1 Page 9 of 10

10 Submitting Submit the following files to the lab dropbox (under Assessments on Learn): L1_rushhour_b L1_rushhour_c L1_rushhour_d L1_loops_b L1_loops_c L1_loops_d Consult How to Submit: Handing in Code for Labs and Assignments on Learn. It is your responsibility to submit to the correct dropbox with the correct files before the deadline. Otherwise you will receive a mark of 0. CS 105 Fall 2016 Lab 1 Page 10 of 10

Unit 12: Artificial Intelligence CS 101, Fall 2018

Unit 12: Artificial Intelligence CS 101, Fall 2018 Learning Objectives After completing this unit, you should be able to: Explain the difference between procedural and declarative knowledge. Describe the