Scenario A, phase 2

It's been brought to my attention that some drivers feel like they get assigned to routes more often than others, resulting in an inadequate balance in workload. As a bit of bright news, we got tons of positive feedback from parents whose daughters were thrilled to spot Marion driving the garbage truck - could we maybe rotate her on different routes to maximize exposure?

Hands-on option

Basic stage for the hands-on option

Draft one or more decision trees that use route-assignment records from previous weeks to figure out who should be assigned which routes next week. Combine (possibly iterative) calculations and conditions to formally express your proposed rules.

Use a combination of writing, pseudo-code, and diagrams to clearly communicate your proposal (leaving no room for interpretation).

In-depth stage for the hands-on option

Add some program code in a computational tool of your choice to automate (at least in part) the driver-to-route assignment process according to the proposal you described above.

Conceptual option

Basic stage for the conceptual option

To help you conceptualize a solution to this problem, start by interacting with this Boolean logic evaluation tool until you understand how the three basic operators — \( \vee \) (or), \( \wedge \) (and) & \( \neg \) (not) — function. You can look up online tutorials on Boolean logic for guidance, such as Ikenaga's explanation.

In-depth stage for the conceptual option

Keep at it until you are also able to describe the functionality of the additional operators: \( \oplus \) (xor), \( \rightarrow \) (implication), \( \leftrightarrow \) (equivalence). If you're following Ikenaga's explanations, you will need look up xor (''exclusive or'') elsewhere (for example on this Wikipedia page).