Policeman and Thief

A town consists of 3 horizontal and 3 vertical roads, separated by 4 square blocks. A policeman and a thief are running along the roads with speeds of 21km/h and 10km/h respectively. Show that the policeman has a strategy ensuring he will eventually see the thief.

Remark: The policeman can see the thief if they are on the same road at some moment. He has no idea about his position at any time.

Tetris Puzzle

As a birthday present last year, I received some fridge magnets. They didn’t come as a puzzle, so I don’t know if they have a solution, but I made a puzzle out of them anyway. The magnets are tetrominoes. There are 7 of each shape. Is it possible to arrange them into a 7×28 rectangle so that they are all used and all inside the rectangle? The closest I have managed is this:

Source:

Puzzling StackExchange

15 Puzzle

On the picture, you can see the famous “15 Puzzle”. The rules are simple – you can slide any of the 15 squares to the empty spot if it neighbors with it. The question is: if the squares with numbers 14 and 15 are exchanged, can you solve the puzzle, i.e. can you bring it to the state shown on the picture?

Wine and Water

You have two 1 liter mugs – one of them halfway filled with water and the other one halfway filled with wine. You pour 300ml water from the first mug into the second one, stir it well, then pour 300ml of the mix from the second mug back to the first one. Now, do you have more water in the first mug than you have wine in the second one?

Non-Negative

You have a rectangular grid and arbitrary real numbers in its cells. You are allowed repeatedly to multiply the elements in any row or any column by -1. Prove that you can make all row sums and all column sums non-negative simultaneously.

Chessboard Infection

On a standard 8×8 chessboard there are 7 infected cells. Every minute each cell which has at least 2 infected neighbors gets infected as well. Is it possible for the entire chessboard to get infected eventually?