# 7. Blurring¶

Studios are in-class activities to give you hands-on practice with new concepts. The first half is the Walkthrough, an instructor-led programming problem. The second half is for you to work on individually or in pairs in class.

These problems are not graded, and you are not obligated to finish them. Get as far as you can while in class, and use them as an opportunity to play with and solidify new concepts.

## Walkthrough¶

For this walkthrough, we will write a program to apply a red filter to an image. (Note that when you run the code, it will take a few seconds to process.)

## Studio¶

For this studio, your job is to write an algorithm that processes an image to make it “fuzzy” looking:

Before:

After:

The algorithm to achieve this effect is actually fairly simple: for each pixel, randomly choose one of its neighboring pixels, and use that pixel’s color instead.

For example, imagine that the table below is a zoomed-in view of the pixels in our image, and that we are trying to alter the center pixel (the one whose color is E):

A  B  C
D  E  F
G  H  I


We want to randomly choose one of the 9 pixels in this grid, and insert its color to replace the center one. Let’s say we choose the bottom-left. This will alter the resulting image like so:

A  B  C
D  G  F
G  H  I


Notice that the center pixel received the color G.

Of course, you want to run every pixel through this same process, so the outer ones should change as well (but in the example above, we only focused on the particular moment when the center pixel was being altered).

Also note that it is okay if, when randomly selecting a neighbor, you happen to choose the center pixel itself. The resulting pixel will be unchanged, but this should happen rarely enough (once per 9 tries) that the overall image will still be nice and fuzzy. Not worrying about this fluke will shorten the amount of code you need to write.

## Tips¶

• If you use pixel indexes i and j, you can access the neighbors by adding and subtracting one from those numbers, i.e. i+1, i-1, ...
• If your pixel is on the very edge of the image, then you won’t have 8 neighbors to choose from. For example, on the left edge, you don’t have any neighbors to your left. Lucky for you, we’ve given you starter code in which the iteration starts at 1 instead of 0, and stops 1 pixel short of the max. You’re welcome!

## Bonus Missions¶

### Bonus 1¶

Write a function that takes in an integer and then displays the multiplication table of that size. For example, if the given integer was 3, the following multiplication table would be displayed:

0 0 0 0
0 1 2 3
0 2 4 6
0 3 6 9


### Bonus 2¶

Write a program that allows someone to play the classic game of rock, paper, scissors against the computer. First, prompt the user to enter how many games should be played in a “best of” format, i.e. best of 5 would require someone to win 3 times, best of 9 would require someone to win 5 times, etc.

Next, start to simulate the games. For the human player, you should prompt them to enter whether they would like to play rock, paper, or scissors. The computer player should randomly choose one of the three options. You should then display the result of the match and current number of wins for each player. If a tie occurs, it should not count towards the total number of matches played.

Hint

Hint: it may be easier to use numbers to represent the three different choices of “rock”, “paper”, and “scissors.”