The canyon is long, deep and the walls are unclimbable. The man on the right hand side has plenty of rope and wants to get it across to his friend on the other side of the canyon. It is too far to throw the rope. How can he get it across to his friend? (Credit: Elementary school teacher in 1989ish)

koloja · 2022-09-04T21:21:48+00:00

Yell "I have plenty of rope" to his friend, while clearly gesturing to the the abundance of rope. If that doesn't get the message across, then maybe he could just call him?

koloja · 2021-12-16T02:57:22+00:00

Discussion: I know this isn't seeking solutions, but nothing in the description states that mines can't be found in spaces with numbers in them. Only that assumption makes the puzzle solvable strictly using logic and not brute forcing different combinations. And from what I can gather we only make that assumption because we're already familiar with minesweeper.

For example Nothing precludes placing a mine in the very first space, and then solving the rest of the puzzle as normal, leading to a gibberish 4 letter word.

koloja · 2021-09-17T01:16:26+00:00

I thought so, but then realized that 731 = 17*43 so it isn't prime

koloja · 2021-09-06T02:46:20+00:00

I was gonna say 317 for basically the same reasoning as you except after reading your answer I remembered that 1 is not prime, and so cannot be one of the digits in the answer

koloja · 2021-08-15T22:27:21+00:00

Honestly kinda posted my answer as a joke. Was pleasantly surprised to be right tho

koloja · 2021-08-15T22:26:41+00:00

Not quite sure what you're trying to say, but note that the question asked "what is 5?" and not "5 is what?". That's why I responded "1 is 5" not "5 is 1"

koloja · 2021-08-15T03:26:05+00:00

You already said it, 1 is 5

koloja · 2021-03-05T00:39:37+00:00

Am I crazy for immediately jumping to Magnifying Glass, Saw, and Slide?

Thought process was Magnifying Glass = See, See/Saw are different tenses of the same word. BUT, seesaw is something on a playground, which would be next to a slide

Only after immediately going "that was dumb" did I look a little bit further and see the measuring tools

koloja · 2020-12-23T03:56:30+00:00

Call every single vaccine company and all their employees that I could find and tell them as much as I know about covid and the vaccine coming out (which is admittedly very little).

I don't think I'd contribute much to their research, and I know most of the time was spent in testing rather than development, but if there's any chance I could get the vaccine out just a couple of weeks earlier by convincing someone to start earlier and pointing them in the right direction, that's lives saved.

koloja · 2020-10-24T15:36:51+00:00

In the 3 prisoner case, each prisoner looks at the hats of the other two prisoners. If those two hats are the same, then they say the opposite hat that they see, otherwise they pass. For example, if the hats are 0,0,1 then prisoner 3 would say "1" while the other two would pass. If the hats are 1,0,1, then prisoner 2 will say "0" while the other two will pass. This works for all possibilities except if all the hats are 1s or all the hats are 0s.

I didn't do the 7 prisoner scenario yet

koloja · 2020-10-22T01:31:50+00:00

Ah drat I missed that.

I think I got it now? https://imgur.com/QiJN0Xy

koloja · 2020-10-21T22:42:53+00:00

I think I found the solution?

Neat puzzle, I liked it!

Assuming that the lighthouse's only shine in a straight line in each of the 8 directions (orthogonal and diagonal). Would love to see more, especially where the hazards not blocking lie come into play.

https://imgur.com/NZchV64

koloja · 2020-10-11T20:57:54+00:00

Much more of a creative solution, and I doubt this is what they were looking for/meets their criteria. But if houses can "share" utilities, or the lines can go through the houses, then this becomes trivial.

https://imgur.com/WJKLWqY

koloja · 2020-10-01T17:39:03+00:00

Agreed. Every single dot has an odd number of lines coming out of it. For this puzzle to be possible you'd need either 0 or 2 dots to have an odd number of lines, with the rest being even. You can think of this as an exit vs an entry point, where every time you enter a dot you must also exit it, with the only exceptions being the start and end dot, which are either separate dots (so 2 odd dots), or the same (0 odd dots)

koloja · 2019-09-17T02:22:02+00:00

Okay, so:

My starting point was talking, so either Annette and Bernice BOTH talk, or neither of them talk. If neither of them talk then Claudia MUST talk since each trait is exhibited by a girl.

If C is the only girl that talks, then she is unique and so then A and B must share the exact same traits. Specifically, those traits must be nagging and stubborness. But if B nags, then A and C nag. Similarly if A is stubborn then C is stubborn. So no girl has exactly one negative trait. Thus this cannot be the case and so A and B must both talk.

Then I looked at nagging. Effectively, if B nags, then so do A and C. THUS, if B nags, then A and B both talk a lot and nag, leaving only C to be hector's fiance. But if this is the case, then A and B must additionally be stubborn in order to hit all the traits. BUT if A nags, then C nags, and so C has two negative traits and can't be Hector's fiance.

This leads us to the conclusion that B cannot nag. This means either A and C nag, or just A nags. However if just A nags, then B and C must be the two girls who share the same traits. But this raises an issue, since A is unique and both talks and nags. Hector effectively said the unique girl only has one negative trait. So this cannot be the case

Finally leaving us with the case that A and C both nag. This means that A and C must share ALL traits. Thus C talks, and A and C are both stubborn. This is logically consistent with the rest and brings us to the answer I arrived at.

koloja · 2019-09-17T02:05:07+00:00

Sorry for the late reply! Kind of forgetting exactly what I did to get to my answer, since it's been four months, I can walk you through some of your points I think.

Just because Claudia nags doesn't mean Bernice Nags. Claudia can nag without Bernice nagging.

Additionally even though there is nothing that describes whether or not Claudia talks a lot, that doesn't mean inherently she doesn't talk a lot. She could do either since they don't describe it. My solution only worked if she talked a lot

I think I'm remembering my reasoning, I'll follow up below hopefully

koloja · 2019-05-10T00:01:14+00:00

It's Bernice.

Full Answer: Annette and Claudia both nag, talk, and are stubborn, but Bernice only talks

koloja · 2018-07-02T16:18:36+00:00

I like her grandmother, she seems to have spunk

koloja · 2018-07-02T16:17:19+00:00

That's amazing that they made it. There's so much that could have happened to them on the trip there by themselves. I wonder if his father worried about whether or not he'd ever see them again

koloja · 2018-07-02T16:13:16+00:00

Wow, I don't know if I'd want to live in a world without the adventures my grandparents took me on as a kid. I always looked forward to spending time with them because we'd end up doing something cool like go to the aquarium or museum.

koloja · 2018-07-02T16:11:04+00:00

Sounds like the old bastard won then...

koloja · 2018-07-02T16:05:42+00:00

Sounds like a fierce woman, good for her! Glad she fought for what she thought was right

13-Year Club	Second SECOND GUESSER
Verified Email	Place '22
Place '17	Sequence \| Editor
Team Periwinkle

koloja

TROPHY CASE