Is it possible to cut a square into four parts so that each part touches each of the other three (ie has common parts of a border)?
Twenty-eight dominoes can be laid out in various ways in the form of a rectangle of \(8 \times 7\) cells. In Fig. 1–4 four variants of the arrangement of the figures in the rectangles are shown. Can you arrange the dominoes in the same arrangements as each of these options?
An entire set of dominoes, except for 0-0, was laid out as shown in the figure. Different letters correspond to different numbers, the same – the same. The sum of the points in each line is 24. Try to restore the numbers.
A square piece of paper is cut into 6 pieces, each of which is a convex polygon. 5 of the pieces are lost, leaving only one piece in the form of a regular octagon (see the drawing). Is it possible to reconstruct the original square using just this information?
A game takes place on a squared \(9 \times 9\) piece of checkered paper. Two players play in turns. The first player puts crosses in empty cells, its partner puts noughts. When all the cells are filled, the number of rows and columns in which there are more crosses than zeros is counted, and is denoted by the number \(K\), and the number of rows and columns in which there are more zeros than crosses is denoted by the number \(H\) (18 rows in total). The difference \(B = K - H\) is considered the winnings of the player who goes first. Find a value of B such that
1) the first player can secure a win of no less than \(B\), no matter how the second player played;
2) the second player can always make it so that the first player will receive no more than \(B\), no matter how he plays.