Persons 1 and 2 count the number of white hats from person 3 to person N. They say 'white' if it's an even number, or 'black' if it is not. If they agree, proceed to the next step. If not, one of them is the spy, and person 3 counts the number of white hats from person 4 to person N, again saying 'white' if even and 'black' if odd, then proceed.
Is this you? As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.
Claim your profile
Articles by Artur Kirkoryan
math - Black and White - Puzzling Stack Exchange
In order to minimize the area shaded black, we want as many squares possible to perfectly overlap in even numbers. For example, take two squares. Separated, they are both single layers, and therefore provide $2$ $units^2$ of black paint. So we overlap these two. If we let the overlapping area be $A$, we then have $(1-A) + (1-A) = 2(1-A) units^2$ of black area. It is quite easy to see that to minimize the amount of area colored black we want $A=1$; the squares perfectly overlap.
Which of these numbers does not belong to the group?
Puzzling Stack Exchange is a question and answer site for those who study the creation and solving of puzzles. It's 100% free, no registration required.
Checkerboard Infection: The Aftermath
As in this previous puzzle, we are again playing with our favorite bacteria, C. Coli, whose natural habitat is an 8x8 checkers board. These are very nasty bacteria - once they are in a cell of a checkerboard, that cell will be infected forever. They spread in a very peculiar way: Each night, at midnight, any cell with two neighbors infected by C. Coli will itself become infected.
Star-Lord and the Space Police
Star-Lord is on a deserted planet along with two space policemen. If he runs into either of them, he will get immediately arrested. Fortunately for Star-Lord, somewhere on two opposite ends of the planet he has hidden a jetpack and a battery for it, which are visible only to him.
Chile to Singapore
Hey guys, I've been into brainteasers since I was little and recently decided to make a puzzle-related website. I figured that this will be the best place to share some of my problems and see if they are any fun. I guess they are too easy, but hope that will entertain you for a bit. You want to travel from Chile to Singapore. You find two sea captains - Jack and Will, which are willing to board you on their ships.
Show More
loading
Actions
Is this you?
As a journalist, you can create a free Muck Rack account to customize your profile, list your contact preferences, and upload a portfolio of your best work.Get in touch with Artur
Contact Artur, search articles and posts on X, monitor coverage, and track replies from one place.
Learn more about Muck Rack