Community Event Puzzle 2 Stacks Giveaway - Ended!

I do not understand your point. @Thunder

 

What you suggested is known as camping.

 

It could be one day because there is a chance that the police will choose the correct apartment room on the first day.

 

What he's looking for is the least number of days the police can have a 100% chance of finding the thieves. One day is not enough to grant a 100% success rate.

 

The answer is 6 because most of the times the best algorithm is the square root of the number of instances.

 

OK. Either everyone didn't read the puzzle or I'm completely off.

Answer:
There are 6 floors, and 6 rooms per floor. That means that there are 36 different rooms that the robbers can go into.
However, the robbers move across 3 times, then up or down once, and then repeat.
Along with that, they can never return to a room they have been in.

This means that this is the longest route the robbers can take:

24 rooms in length.


Following this logic, what happens if the cops wait in the 3rd or 4th room on the 3rd or 4th floor?
The robbers have to pass through all of those rooms in the first 16 days.
So the cops will find them in 16 days.

 

Sequence?

sequence?

 

day 1:
This happens

 

Ye that happens in 1 room, but what if they started in a different room?

 

Hey, I think I have the answer to your problem:


Day 1: Search floor 2, apartment 2

Day 2: Search floor 2, apartment 3

Day 3: Search floor 2, apartment 4

Day 4: Search floor 2, apartment 5

Day 5: Search floor 3, apartment 5

Day 6: Search floor 3, apartment 5

Day 7: Search floor 3, apartment 4

Day 8: Search floor 3, apartment 3

Day 9: Search floor 4, apartment 3

Day 10: Search floor 4, apartment 2

Day 11: Search floor 4, apartment 2

Day 12: Search floor 4, apartment 3

Day 13: Search floor 5, apartment 3

Day 14: Search floor 5, apartment 4

Day 15: Search floor 5, apartment 5

Day 16: Search floor 5, apartment 5

Day 17: Search floor 5, apartment 4

Day 18: Search floor 5, apartment 3

Day 19: Search floor 5, apartment 2

Day 20: Search floor 5, apartment 2

Day 21: Search floor 4, apartment 2

Day 22: Search floor 4, apartment 3

Day 23: Search floor 4, apartment 4

Day 24: Search floor 4, apartment 5

Day 25: Search floor 3, apartment 5

Day 26: Search floor 3, apartment 5

Day 27: Search floor 3, apartment 4

Day 28: Search floor 3, apartment 3

Day 29: Search floor 2, apartment 3

Day 30: Search floor 2, apartment 2


So, the least amount of days where the police will have 100% of finding the thieves is 30 days

 

Just saying but to be honest I doubt that’s the answer.

 

I have simulated this, and concluded your answer is wrong

 

how so

 

When i simulated it, the thieves weren't caught in the 30 days you said

 

I mean like how did u simulate it

 

I drew the flat on a piece of paper, and use your sequence to help the thieves avoid the police
If they are able to aviod them, the sequence isn't right and the your answer is wrong

 

Well, it’s just a 6x6 box so you could do it on your mind.

 

Well to make it anlittle eazier you can use a piece of paper

 

Day 26: Search floor 3, apartment 5
26:1,2(L)
Day 27: Search floor 3, apartment 4
27:2,2(L)
Day 28: Search floor 3, apartment 3
28:2,1(U)
Day 29: Search floor 2, apartment 3
29:1,1(L)
Day 30: Search floor 2, apartment 2
30:1,2(L)

ya mess up ur floor switch here, but there's probs still another route

 

8 idk maybe my name jef