bonanova

From what I can gather re Japanese honorifics, I am either your grandfather or your friend.

Congrats to witzar! I just counted them.

Clarifications. No two Boxes contain the same number? 8. Once and only once? 15. One and only one column? 16. Do you mean exactly two times? To prohibit having 2 sixes and 3 eights? 17. The five column sums share one and only one prime factor? 18. Once and only once? Then, if CL is 45 then 50-59 do not appear in col D? 19. Major diagonal? Thanks.

All good points. There are two parts to the puzzle. OP does not tell you how to achieve optimal dryness. That is left to the solver. I think everyone got the point that the frontal drop count does not depend on speed. It only depends on the area the drops hit. So, frontal drops are minimized for minimal frontal area. The top (head) drop count does depend on speed and tends to zero as Speed increases. So it's just: minimize the total drop count, then find the speed that doubles it. The OP rules out crawling I guess the final distinction to be made is the difference between restricting and assuming. Regarding orientation, the OP restricts only that the man does not lean. If you make further restrictions, by assuming, you limit the search space unnecessarily.

I'm guessing that the puzzle is to create a 5x5 array of numbers that satisfy the clues. I'm not sure about the reference to a stack of cards. Nowhere does it say that at least one crd in the stack has the required array of numbers.

n/p

Well some of us lived those experiences. Others learned of them in history classes.

You're right. I should have inserted some reverse blind alleys.

Bingo! One other answer was correct, but you also got the reason correct. Didn't know that fact about Apollo.

A Knight bored of his chess game leaves his board of boredom and enters the grid of letters shown below, in the north west corner, at the letter A. After twenty-five moves, he exits the grid near the south east corner at the letter Z. In between he lands on each letter, once, in proper sequence. Can you trace his path? In describing your answer, each move can be described as two letters. For example, SE would mean two spaces South, one space East. ES would mean two spaces East, one space South. That is, the direction of the two-space move is mentioned first. A V Z G E D I P O I T S B C R D E O H G C B H D E F I J U S O C H K H R H G V S C T F F Q J K R S H O D L P R P R W L U U I S N H K L T I Z E M Y D N Q X T U U L L O I L N N T P Z L H L R P S M Y G O

Eight of these words share something. Which is the odd one? Atlas Earth Mars Thor Apollo Venus Gemini Mercury Saturn

Good analysis all, but it's actually faster than the answers given so far.

A while ago that asked whether how wet you get moving a fixed distance in the rain depends on whether you walk or run. Let's assume there is a speed that keeps you the driest, but you don't have the stamina for it. My question is what speed should you run to get only twice as wet as optimal? Assumptions you can make: You are [a rather squarish] 6 feet tall, 2 feet wide and 6 inches thick. You always move in a standing position, i.e you never lean. Shelter is 1000 feet away, on level ground. The rain is falling at a speed of 10 feet per second. At any given place or time there are 1000 raindrops per cubic foot. Enjoy!

Only a countable infinite number of naughts can be drawn on a sheet of paper.

Right on both counts. Nice puzzle Barcallica.

That's the right reason and the right answer. And is the "naught" and "one" distinction evident?

That's the notion I had in mind. Nice. Actually a [finite] sheet of printer paper suffices to show the distinction of the two classes. Details of the type font come into play, but I think in BD font face only four of the decimal digits are type 1. Three of yours are in that group.

Thinking along the right lines (npi).

That is the only turn. OP edited to clarify that point.

I read this one a while back and found it challenging. Place a single die on QR8 of a chessboard, or a smaller 8x8 grid of squares. The die "moves" from square to square by tipping on its side in a N, E, S or W direction, [thus] making a 1/4 turn each time it moves to a new square. The object is for the die to move to each of the squares, only once, and finish on KR8. That is to tour the board beginning on the NW corner and end on the NE corner. The final constraint is that the 1-spot must be up on the beginning and ending squares, but on none of the intervening squares. To describe the tour, number the board left to right so that the top row (8th rank) Is 1 2 3 4 5 6 7 8 and the bottom row (1st rank) is 57 58 59 60 61 62 63 64. Again, begin on square 1, and end on square 8.