No. The nature of the wazir’s move means that it visits light and dark squares alternately. The board has 64 squares, and the piece begins on a light square, so a successful journey would end on a dark one. The target square is light, so the task is impossible. Simple enough!

Eight. If a MULDRUFF holds 20 DROONS, and a green SLACKEN is 10% bigger than a DROON, then a MULDRUFF can accommodate at most 18 green SLACKENS. And if a WALLAX is smaller than this, then it can hold at most 17 green SLACKENS. But if each WALLAX is predominantly red, then the proportion of green SLACKENS in its contents can’t be more than one-half. So the largest number of green SLACKENS it can contain is 8.

11/22/2025 UPDATE: This is just wrong. Let a DROON have size 1. Then a MULDRUFF has capacity 20, and a green SLACKEN has size 1.1. So our MULDRUFF will accommodate 9 green SLACKENs (= 9.9) and 10 DROONS (= 19.9 < 20). Now we can transfer this cargo to a WALLAX of, say, capacity 19.95 and fulfill the terms of the problem with 9 (not 8) green SLACKENS — the WALLAX remains predominantly red by both number and volume. Thanks to everyone who wrote in about this.

Four PLONTHS make a GLEEPER, four GLEEPERS make a BLAHMIE, and four BLAHMIES make a POOSTER. So half a POOSTER is 32 PLONTHS.

1. Rf5!

1. … Kh7+ 2. Rf8#
1. … Rh7 2. Rb8#
1. … g6/5 2. Bc4#
1. … B any 2. Rxg7#

From The Problemist.

No. The player with the Xs has won and so must have made the last move. If that player moved first, then there ought to be one more X than there are Os in the diagram. If the player making Os went first, then there should be an equal number of Os and Xs. The diagram contains more Os than Xs, so the position is impossible.

From Dr. Crypton and His Problems: Mind Benders From Science Digest, 1982.

Bert is 72, Ben is 80, and Bill is 85.

Start both timers. When the first one reaches its limit, turn it over. Do the same with the second. When the first one again reaches its limit, 8 minutes altogether have passed, which means that the second timer has been running for 1 minute since you restarted it. Invert that timer, and when the minute’s worth of sand has run out, 9 minutes altogether will have passed.

Similar: How can you measure 45 minutes using two fitful hour fuses?

Consider three groups of people: N contains unsociable weirdos, W contains all the other weirdos, and U contains all the non-weird unsociable people. Let n, w, and u be the number of people in each of these groups, correspondingly, and let a be the number of pairs of acquaintances, each containing one person from W and another from U. We need to prove that w + n < u + n, or w < u.

Well, no one in N can have an acquaintance in W, since weirdos don’t associate with sociable people. Since acquaintanceship is reciprocal, this means that each of the people in W is finding all their numerous (10+) friends in U. So a is at least 10w.

A person in U can find friends anywhere but must have fewer than 10 of them. So a is less than 10u.

Combining these inferences, if 10w ≤ a and a < 10u, then 10w < 10u and w < u.

11/03/2025 UPDATE: Reader Wolfgang Schilhan writes:

Hi! I noticed there is a flaw in the puzzle “A Prickly Puzzle” from October 24.

While the number of weirdos can’t be larger than the number of unsociable people, it still can be equal.

Consider a group of 10 or fewer people, each of them mutually acquainted but with no other acquaintances outside this group. Then everyone in this group is unsociable, since they have less than 10 aquaintances, and also a weirdo, since all their acquaintances are unsociable. Therefore w = u.

Imagine a society consisting only of such groups, plus any number of sociable people. Or a network of groups of 9 or lesser people like above, where anyone can have at most one acquaintance from another group. In all those examples, every unsociable person is also a weirdo and vice versa, therefore the number of weirdos equals the number of unsociable people.

The solution ignores the cases where the groups W and U are empty.

The error in the proof from the solution lies in the line “A person in U can find friends anywhere but must have fewer than 10 of them. So a is less than 10u.” This is true only if u > 0.

If u = 0, then a also is zero and therefore not less than, but equal to 10u.

(Thanks, Wolfgang.)

At first it seems we have too little information, but it turns out the angle is invariant with the size of the larger square — grab point H and drag it left and right:

(GeoGebra resource by John Golden.)

The ball is always working against air resistance, so it’s losing energy all the time; at a given height, its total energy while rising is greater than while falling. The ball’s potential energy at this height is the same in both cases, so its kinetic energy (and hence its speed) is greater when it’s rising. So it takes longer to fall than to rise.