Project 4 - Due Tue Oct 1 at 23:00

Reading

Slides and notebooks from the functions lecture, the booleans lecture, and the conditionals lecture
Problems and solutions from Lab 3 and Lab 4
Think Python, Chapter 3 and Think Python, Chapter 6 cover material on functions which remains relevant; section 6.4 is especially relevant now, although sections 6.5 and 6.6 are still stuff that we're going to introduce later.
Think Python, Chapter 5 covers booleans and conditionals, although sections 5.8 through 5.10 cover recursion which we will save for later, so you can skip those for now.

The instructions for each task:

Task 1: Animal Quiz — Ask the user some questions to decide (using booleans and conditionals) what kind of animal they might be. Note that this week, you are required to do both tasks. For this task, having a partner is optional but recommended.
Task 2: Exploration Policies — Write policies to control a robot stuck in a maze. Note that this week, you are required to do both tasks. For this task, having a partner is optional but recommended.

These tasks will give you practice with the use of booleans and conditionals. You will also continue to define your own functions.

This week, you must complete both tasks.

If you want to find a partner to work with for this project, use this Google Sheet to do so.

Reminders

Time Estimate

Our per-task estimate for this project is 2-3 hours, plus up to an hour of reading.

Upload your tasks via the Potluck server by the deadline (Tue Oct 1 at 23:00).
- For animalQuiz, each team member must submit animalQuiz.py.
- For mazePolicies, each team member must submit mazePolicies.py.
Double-check the status of your submitted tasks, since there may be warnings.
Reminder: you can submit as many times as you like, and only the most recent submission will count for your grade.
If you run into trouble with the submissions server, contact Peter Mawhorter, and include a copy of the file(s) you were trying to submit.
Check your score for each task and submit revisions if you need to.