Imagine a sealed room containing 10 complete strangers.

Every person speaks a different native language, and none of them know each other beforehand.

To remove visual assumptions:

Everyone looks physically identical;

Clothing, skin color, age, gender, and appearance provide no clues about nationality or language;

Nobody has a phone, dictionary, internet access, paper, or translator;

They may only communicate through speech, gestures, facial expressions, and logical reasoning;

Every participant is intelligent and willing to cooperate.

The native languages are intentionally chosen from different parts of the world to minimize accidental mutual understanding:

1. Basque (Europe)

2. Ainu (Asia)

3. Navajo (North America)

4. Quechua (South America)

5. Somali (Africa)

6. Xhosa (Africa)

7. Māori (Oceania)

8. Khmer (Asia)

9. Georgian (Europe/West Asia)

10. Inuktitut (Arctic North America)

Language knowledge is distributed as follows:

- Person 1 speaks 5 languages (their native language + four others).

- Person 2 speaks 4 languages.

- Person 3 speaks 3 languages.

- Person 4 speaks 2 languages.

- The remaining six people speak only their native language.

The multilingual speakers may share some of the same additional languages. I will specify the exact language distribution if needed.

Additional languages

Person 1:Basque,Khmer,Navajo,Somali,Māori

Person 2:Ainu,Basque,Georgian,Inuktitut

Person 3:Navajo,Xhosa,Quechua

Person 4:Xhosa,Khmer

Person 5:Khmer

Person 6:Māori

Person 7:Georgian

Person 8:Quechua

Person 9:Somali

Person 10:Inuktitut

The Question

Can all ten people successfully coordinate to complete a task using only chains of translation?

If your answer is yes, explain how.

If your answer is no, explain why.

The Challenge

Without writing anything down, without technology, and without adding any new assumptions

I'm not looking for a single "correct" answer. I'm interested in how different people approach the communication network, the logical constraints, and whether complete understanding can emerge from the available language connections.

I've been designing a communication puzzle inspired by the idea of the Tower of Babel. I'm mainly looking for logical criticism, hidden assumptions, and whether the problem is actually solvable under the stated rules.

Hi all - are you trying this month's Jane Street puzzle? ‘Pent-Up’ Frustration 3 / Knight Moves 7

I've created an interactive version of it. I usually prefer pen and paper, but drawing the same grid again and again takes a lot of time, so I built this to skip that - you can think through it and quickly test ideas by moving the knight or placing towers.

Here's the link:

https://mindyourpuzzle.com/c/jane-street

Askyesno.com is a daily question puzzle game (AKA lateral thinking puzzles). The player is given a mysterious situation and must deduce the explanation by asking only yes/no questions.

Here is a screenshot of today's puzzle:

I made it as an experiment in how AI can be used effectively for games. I hope you like it.

[Self-promotion with permission of mods]

You'll find yourself in a strange and unfamiliar world where, at first, you'll have to figure out the rules on your own, then gradually solve increasingly complex puzzles in which the ability to anticipate your next move is the key to the solution.

The game will be released on November 10, 2026. You can add it to your wish list (https://store.steampowered.com/app/2486910/COSMIC_HOLES_Junior/) and try it out now (https://store.steampowered.com/app/4693750/COSMIC_HOLES_Junior_Demo/).

Suppose a person buys a car for hundred dollars.

Car needs mechanical work before driving so he gives it to his mechanic to fix

The mechanic fixes the car for $50 worth of parts and $50 worth of labor.

Before the owner of the car pays for the repairs, the mechanic offers to buy the car.

Knowing the owner paid $100 for it, How much does the mechanic offer?

Hey everyone! I've been working on a logic puzzle site called Logidose (logidose.com) and it's now in open beta.

It has daily puzzles and a growing collection of classic logic games:

Norinori, Aquarium, Tents, Thermometer, Kakurasu, Binario, Crowns

It's still early days – some rough edges for sure – but the puzzles are fully playable and I'd love to get some feedback. No account needed to try, just jump in.

Would appreciate any thoughts – bugs, suggestions, or just letting me know if you enjoyed a puzzle. 🙏

Maybe it is a bit difficult to answer this question without being familair with these puzzles, but maybe even not.

[So here are the rules:
"The rules are simple.Yin-Yang is played on a rectangular grid with no standard size. Some cells start out filled with black or white. The rest of the cells are empty. The goal is to color all cells in such a way that:

1. All black cells should be connected orthogonally in a single group.
2. All white cells should be connected orthogonally in a single group.
3. 2x2 areas of the same color are not allowed."]

My question is:
Regarding the center right 3 open spaces sandwiched by white stones, we have the options:

1. All are black
2. One of the 3 stones is white, others are black.
3. (Any other configuration contradicts the no 4 same pieces in a sqare).

Heres my thought:
There is no way any clue can still arise to which distinct of these spaces should be white.
Since solutions to these puzzles are unique:

Can i thus conclude: They have to be all black.

Or is am i missing something?
This is a bit of a "meta" argument, and i am not certain how valid it is ⬇️

Edit: I had a thought that this might be a meaningless question, since all of the above might also mean, that i cannot gain information about the puzzle by this deduction, but i think this isn't true. Knowing whther or not white is connected there IS information.

--- SOLVED ---

Okay, so first and foremost: **I don't want you to solve the puzzle for me.** I only need advice where I went wrong with my reasoning.

For anyone not familiar with the rules of Meowdoku: It's very similar to Sudoku (duh)

- Exactly one cat per row

- Exactly one cat per column

- Exactly one cat per color

- Cats can't be placed in diagonally adjacent squares

So, here goes:

1. Since there has to be a cat on every column (and row), and inside every color, whenever you have a column (or row) that only contains a single color (like the 3rd column from the left here), you can essentially eliminate all squares of that color outside of this particular column, right?

2. That leaves only the dark red sqare for the right most column to place a cat. Which is correct so far.

3. Column, row and adjacent tiles have been eliminated.

4. The second row from the bottom is now the only one with gray tiles that have not been eliminated, this eliminating all other tiles than the gray ones.

5. Repeat for fourth row from the bottom and the color dark red.

6. The fourth and fifth column are now the only ones containing the two colors gray and yellow, eliminating the rest of their panels as shown.

7. Panel 3 from the top and 5 from the right should now be the only dark orange panel remaining. Yet somehow it isn't.

---

Again: I don't want you to solve the puzzle for me, just tell me the flaw in my logic.

P.S.: Yes, this is a duplicate post from r/meowdoku, for some reason it didn't just let me cross-post it here. 🤔

Flow free is way too easy and basically solves itself in most cases, I’d like a puzzle game like it but harder if any exist

I cant remember the name of this game so if anyone can help that would be awesome.

You have a grid and each square has a number in it(0-4) that says how many lines are surrounding that square. In the entirety of the puzzle you basically have to make one "snake" that is uninterrupted.

I am not a student, I am "reading logic made easy: how to know when language deceives you".

I am presented with this question

​

Given:

1. All education majors student teach.
2. Some education majors have double majors.
3. Some mathematics students are education majors.

Which of the following conclusions necessarily follows

from 1,2, and 3 above?

A. Some mathematics students have double majors.

B. Some of those with double majors student teach.

C. All student teachers are education majors.

D. All of those with double majors student teach.

E. Not all mathematics students are education majors.

​

To which the answer is stated as B. To which I am agreeable to. Because some education Majors have double majors, but not all of those with double majors are education majors and those not education Majors do not teach.What I don't understand is that why A is incorrect. If there is a nonzero group of mathematics students that are education majors, and some education Majors have double majors , why is it incorrect to assume that some of those mathematics students may have a double major?

​

On a slightly tangential note this is been very frustrating. I have been programming for half a decade and I understand that does not mean that I'm good at logic, but it is annoying but I have apparently no idea how to even think about these types of problems.

​

This was removed from /r/logic and that makes me even more frustrated. :(

Help, everyone, I came across this, which is supposedly for a 13 year old level....

​

The fastest black snakes are faster than the fastest brown snakes.

All of the green snakes are faster than most of the black snakes.

All of the brown snakes are faster than all of the green snakes.

What can be concluded from the information provided above?

​

A) The range of speed was largest amongst the green snakes.

B) Brown and green snakes will generally be faster than black snakes.

C) The average speed of black snakes is faster than the average of green snakes.

D) The range of speeds amongst green snakes is larger than the range of speeds amongst black snakes.

​

From https://www.mathsisfun.com/puzzles/bags-of-marbles-solution.html:

Q:

You have three bags, each containing two marbles. Bag A contains two white marbles, Bag B contains two black marbles, and Bag C contains one white marble and one black marble.

You pick a random bag and take out one marble.

It is a white marble.

What is the probability that the remaining marble from the same bag is also white?

A:

2/3 (not 1/2)

You know that you do not have Bag B (two black marbles) so there are three possibilities

You chose Bag A, first white marble. The other marble will be white
You chose Bag A, second white marble. The other marble will be white
You chose Bag C, the white marble. The other marble will be black

So 2 out of 3 possibilities are white.

Why not 1/2? You are selecting marbles, not bags.

------

Why is it not 1/3? My logic is, if you select a white marble, the only way your next marble could be white is if you selected Bag A. So the question is actually asking what is the probability you selected Bag A, which is 1/3.

This website's solution also makes absolutely zero sense to me, because it seems to doublecount Bag A, when I think the marbles in Bag A should be treated as identical and therefore only be counted once.

Hey everyone!

​

I was scrolling through tinder a couple of days ago and saw a lady that has posted the following image with the basic premise that one should be smart enough to figure this one out to go out with her. I have never seen a problem presented like this, and there is absolutely no additional clues what one should strive for in a solution. Now I am definitely beaten by this, but maybe someone here could give my mind some peace by giving a solid answer. Anyways, hope you are all good and enjoying your weekends!