Which one of the following is a pair of loads that can both be mulch?

sadaabrahman on September 4, 2019

Setup

Is it necessary to come up with all the possibility's beforehand? Any other way to do it?

Replies
Create a free account to read and take part in forum discussions.

Already have an account? log in

Irina on September 4, 2019

@sadaabrahman,

Great question. No, this game neither requires listing of all the possibilities, nor would I recommend considering all the possible options beforehand. The rules allow us to infer that to meet the 3x max cleaning restriction, we must either have MMM sequence together, or have one MM string and one M load at either end of the hauling sequence (#1 or #7). If MMM string corresponds to hauls 5,6,7, this would result in only 1 cleaning. Any other MMM string -456 or 345 - would result in 2 cleanings, and breaking it down into 1 MM string and 1 M haul would result in 3 cleanings. These inferences are sufficient to answer all of the questions for this game.

Let me know if you have any further questions.

#JW on September 25, 2019

I totally see the benefit to writing everything out; however, if we are going to do this (like the video explanation demonstrates) what technique do you suggest using? And specifically what I'm asking is, would you start out (for this example) SSSS, then move to SSS then is it trial and error (which is what I ran into in the later questions)? Just want to find a technique that is efficient for the section.

Irina on September 25, 2019

@Jwebb,

If you prefer writing out all the possible scenarios, I would use M as your base, considering M placement is more restrictive (#5 must be M). Then I would write out three possible MMM sequences:
SSSSMMM
SSSMMMS
SSMMMSS

Followed by MM and M sequences:
MSSSMMS
MSSMMSS
MMSSMSS
SSSMMSM

Let me know if you have any further questions.

taylorhoffman on July 4, 2020

Hello,

There is nothing in the passage that states the mulch loads have to be consecutive. We can still have 3 cleanings if we have the following:

MSMSMSS
= MS (clean)MS(clean)MS(clean)S

Initially, when I started the first questions I wrote it out as Mulch in the #1,3,5 spot for answer A and all of the rules were followed.
When I attempted answer B with Mulch in spot #2,3,5 all of the rules were followed as well.

Are we supposed to find the answer that is the most "efficient?" In that the least amount of cleans are being used?

Thank you for your help!

taylorhoffman on July 4, 2020

(the above)is for @taylorhoffman!

Jasmine1 on November 15, 2021

I did the same thing as the person above. I put M in 135 and go 3 cleanings. However, it is wrong in this question. Am I missing the M needing to be consecutive?

Jay-Etter on January 26, 2022

Hi @Jasmine1,
Remember that the truck has to be cleaned each time it goes back and forth between M and S, not just each time after it carries an M. If we put M in 135 we would have
MSMSMSS. We would have a cleaning at each exclamation point:
M ! S ! M ! S ! M ! SS to make a total of five cleanings if set it up like that which is too many.

You're right we're going to need some of the Ms to be consecutive, otherwise we'll end up with too many cleanings.