Feel free
to post a tough puzzle in the guestbook above!
1. In this
unusual game of chess the players were permitted to arrange their eight high-ranked pieces behind the pawns in any order with
the bishops on opposite colors. In addition to the normal rules for claiming a draw, a player can also declare a draw at the
time his king occupies the square where it began the game if it has already occupied the square where the opposing king began
the game. White's king began the game on d1 and black's king began on b8 (white's bishop is on e1). White's
king has not already occupied b8. It's White's move. How does he force a sure draw?
Solution
Solution to shuffle chess puzzle. White claims a draw by the 50 move rule! To show the rule applies one must prove
that the present position is only possible if no pawn was moved or no piece was captured within the last 50 moves. Given
the initial position of the pieces, one can show that 50 moves must have transpired from the last pawn move (which was white's
pawn on b3 capturing black's pawn on c4). This move was also the last capture. At that point black's rook on b5 moved to
its position at c2. White's rook which was initially located on c1 then moved from d1 following a path along the a file to
the e file. Then the second Black rook followed the return route from the e file to its location at d1 closely followed by
White's rook which ended up on c1. This would have required 31 moves. White's second rook followed the same path to its location
requiring 42 moves. During this process, White's king was on h8 and Black's king moved from f6 to f8 to shield White's king
from check when Black's rooks moved to e8. Eight moves are required for White's king to move from h8 to b5. This totals 50
moves.
2.
The Baseball Puzzle.
Major League Baseball teams play 162
regular season games.In its first game of the season a particular team
scored only one run in the game-- in the 1st inning. In the second game they scored four runs in the
1st inning, and one run in both the 2nd and 3rd innings of the game and didn't score for the rest of the game. Midway
through the season they scored runs only in the 3rd, 8th, and 9th innings of a game.Assuming
a pattern exists with these games, how many runs had the team scored for the season after that particular game? Note: this
pattern continued for every game played up
to that point in time.
Solution
They had scored 388 total runs for the season after that game. Subtract 1 from each inning that the team scored.
In other words, for the first game that would yield 0. Let that number be n. Determine the value of 2 to the n power. Do this
for every inning in which the team scored in a particular game and add the resulting sums. This will yield the total runs
scored by the team for the season after that particular game.
3. Letter Cross Out
Cross out ten letters in such a way that the remaining letters spell a single word:
ASNQINNEGLLEEWTTORERD
Solution
Cross out every 4th letter leaving ASNINNGLLEWTORED; then cross out every 3rd letter leaving A SINGLE WORD.
4.
The three variable problem
Find a solution for this equation:
b/(a + b) + a + b + c = b/(a + b) × a × b × c
Solution
The real question is this: does only one solution exist for a, b, and c (i.e., 1, 2, and 11)?
5. The
Tournament Bracket Puzzle
Eight people participated in an NCAA
basketball pool in which each person picked eight teams (totaling all of the 64 bracketed teams). Each person noticed that
the sum total for the seed numbers of his eight teams was 68. Each person had two teams in each of the four regional brackets
with one team in the upper half of the bracket and one in the lower. Seed numbers 1, 4, 5, 8, 9, 12, 13, and 16 are in the
upper half; seed numbers 2, 3, 6, 7, 10, 11, 14, and 15 are in the lower. Moreover, each person noticed that at least one
of his teams played a team of each of the other seven players in the first round. A #1 plays a #16, #2 plays a #15,
etc. How were the 64 teams selected? Note: this problem is difficult and only one solution might exist.
Solution
Here is a solution with A, B, C, and D representing the four regional brackets:
The problem is difficult because many think each player must hold either a #1 or #2 seed. But this cannot be the case.
6.
The Average Salary Puzzle
At dinner five men determined the average annual salary of the five using a method. After dinner two of them moved
to a distant country-- never to be heard from again. With their method no man could possibly determine the salary of any of
the other men even by subsequently conspiring with any of the other four. Moreover, no man will directly or indirectly
reveal his salary to any of the other four. One of them had no salary. How did they do it?
Solution
Each man secretly adds any 10-digit number to his salary and types the resulting sum on a sheet of paper. These
sheets are placed in a hat. Each man then types four numbers on separate sheets of paper that all look the same whose sum
equals the 10-digit number they added to their salaries. These numbers are placed in a different hat. In turn each man randomly
draws two of those sheets from the second hat and announces their sum to the group. The resulting sum of the numbers in the
second hat is subtracted from the sum of the numbers in the first hat (and divided by five).
7.
21 Integers
I'm thinking of a sequence of 21 consecutive
integers. The sum of the squares of the first 11 integers equals the sum of the squares of the last 10 integers.
What is the first number in the sequence?
It's easier than you think.
Solution
The number is 210. For any such sequence of integers that contains an odd number n, first determine the sum of
all the even numbers from 2 to n. Multiply that sum by 2 and subtract (n - 1)/2 to find the first number in the sequence.