Refactoring: The fill_walk() method is lengthy. Create a new method called get_step() to determine the direction and distance for each step, and then calculate the step. You should end up with two calls to get_step() in fill_walk(): x_step = self.get_step() y_step = self.get_step() This refactoring should reduce the size of fill_walk() and make the method easier to read and understand. Do this in the RandomWalk1 class. No need to turn in a program called 15-5, just have the refactored code in your random_walk.py file.
15-5. Refactoring: The fill_walk() method is lengthy. Create a new method called get_step() to determine the direction and distance for each step, and then calculate the step. You should end up with two calls to get_step() in fill_walk():
x_step = self.get_step()
y_step = self.get_step()
This refactoring should reduce the size of fill_walk() and make the method easier to read and understand. Do this in the RandomWalk1 class. No need to turn in a program called 15-5, just have the refactored code in your random_walk.py file.
15-6. Two D8s: Create a simulation showing what happens when you roll two eight-sided dice 1000 times. Try to picture what you think the visualization will look like before you run the simulation; then see if your intuition was correct. Gradually increase the number of rolls until you start to see the limits of your system’s capabilities. Adjust comments, labels and file names for the new program. Start with die_visual_4.py.
Step by step
Solved in 4 steps with 1 images
