This action might not be possible to undo. Are you sure you want to continue?
Author – Riad Khanmagomedov Answers must be sent firstname.lastname@example.org not later than 10 February 2007 (at 24:00 Moscow time). Also, please tell us which puzzles you thought were the two best and the two worst. For any questions write to: http://diogen.h1.ru/cgi-bin/forum.pl. Good luck!
1. Mirrored fence
Draw a single continuous loop (a fence) going along the grid lines/ The loop may not touch or cross itself. Each number shows the quantity of sides of the cell used by loop. The fences part lying inside any rectangle with the centre in the large dot has central symmetry.
Answer format: Write the number of the corners of the fence/. For the given example the answer would be: 20. Score: 5 points.
Place butterflies of three kinds (A, B, C) into the grid (body of butterfly with open wings can be horizontal or vertical; body of butterfly with closed wings can be only horizontal.). Butterflies cannot touch each other not even by the corner. Numbers at the right and at the bottom show the number of cells occupied by butterflies in the corresponding row, numbers at the left and at the top show the number of butterfly’s bodies (the dark segments) intersected the corresponding row.
Answer format: First write the content of the diagonal going from top left corner to bottom right, then the content of diagonal going from top right to bottom left corner. Use sign “+” for empty cells and the letters A, B, C for cells occupied by corresponding butterflies. For the given example the answer would be: +++BB, +A++C. Score: 6 points.
3. Offset sudoku
Fill in the grid with digits from 1 to 9. Digits in every row, column and each one of the nine marked squares 3x3 cannot repeat.
Answer format: Write the content of diagonal going from top left corner to the bottom right. Score: 5 points.
4. Crawling snake
Place a snake (the line with width of 1 cell and length of 36 cells) into the grid 10x10. Snake cannot touch itself not even diagonally. Every second the snake crawls – move its head into any of free neighbouring cell and its tail into previous occupied cell (all other cell which was occupied by snake are still occupied).During the movement snake cannot touch itself even diagonally. The first diagram shows the starting moment, the second – intermediate and the third – the finish, and the time between 1 and 2, and also between 2 and 3 is no more than 35 seconds. Digits outside the grid show the quantity of cells occupied by the shake in corresponding rows.
Answer format: Write the content of marked column from top to bottom using letter S for the cells occupied by the snake and sign “+” for the empty cells. For the given example the answer would be: +++S+. Score: 7 points.
5. Battleships – palindrome
Place the standard fleet into the grid. Ships cannot touch each other not even diagonally. Digits in the circles show the quantity of cells occupied by the ships in the horizontal and vertical rows going throw the circle. The digits also show the quantity of cells occupied by the ships in both diagonal rows going throw the circle. This puzzle is palindrome – after rotation in 180 degrees all digits become the same. Ships cannot occupy the cells with the digits.
Answer format: First write the content of the first column from top to bottom, then the content of the last column from top to bottom. Use sign “+” for empty cell and letter D for the cells occupied by ships. For the given example the answer would be: D+++D+, +++DDD. Score: 6 points.
6. Star sudoku
Fill in the grid with the digits from 1 to 9, which cannot repeat in rows, columns and outlined areas. Every row, column and outlined area must contain exactly one star (in the cell not occupied by digits). The stars cannot touch each other even diagonally.
Answer format: Write the content of first column from top to bottom. Use S for a star. For the given example the answer would be: 132S4. Score: 7 points.
7. Summed patience
Put the cards from 2 to 10 of four suits into the grid (two cards will be left unused). Cards lying around any one of green squares must have different suits and values. Numbers inside the green squares show the sum of values of neighbouring cards.
Answer format: Write cards of bottom row from left to right using letters for suits: S (spades), C (clubs), D (diamond), H (hearts). Answer may look as: 10S, 9C, 8D, 7H. Score: 7 points.
8. A-B-C loop
Place 12 sets of letters A, B and C into the grid. Letter B must be in the middle of every set. One set can be horizontal, vertical or around the corner, but not diagonal. The same letters cannot touch each other not even diagonally. Digits outside show the quantity of letters A, B, C in corresponding row. You must draw single continuous loop through the centres of all empty cells formed by horizontal or vertical segments.
Answer format: Write row by row from left to right coordinates of all letters C. For the given example the answer would be: C6, F6, C3, F3, B1, E1. Score: 8 points.
Place into the grid objects having zero height (5 playgrounds, 3 car parks, one pond), which cannot touch each other even diagonally, and buildings of different heights. Every row (horizontal or vertical) must contain N buildings of different heights from 1 to N (N<8, for each row can be its own N). Numbers outside the grid show quantity of objects (including objects of zero height) visible from corresponding direction. Three marked cells belongs to the objects of zero height.
Answer format: Write content of third column from top to bottom. For the given example the answer would be: 0010. Score: 9 points.
Choose 4 pentaminoes from the given 12. You can use each of chosen pentamino no more than three times. Place them into the grid. Pentaminoes cannot touch each other not even diagonally. You can rotate but cannot reflect them. It must be possible to mark full dominoes set of 28 pieces (from 0-0 to 6-6) in the remaining cells. Maximize the quantity of used pentaminoes.
Answer format: Write the position of all pentaminoes using letters of pentamino and coordinates of two cells – first having the letter and second having the circle. For the given example the answer would be: L-a5-b3, L-g3f5, P-c5-d7, P-e3-d1 Score: 4K-36, where K is the quantity of used pentaminoes.
Place into the 10x10 grid some numbers of Х (crosses formed by two segments of length 2 with centres in grid nodes) and some quantity of О (black one-unit squares). Elements cannot touch each other not even by corners. It must be possible to draw single continuous loop going though the centres of all white squares. The loop consists of segments parallel by grid lines and cannot touch or intersect itself. Loop cannot intersect the crosses. Every X gives you 3 points, every O – one point. Maximize the sum of points.
Answer format: Write first your sum, then coordinates of centres of all X and then the coordinates of centres of all O. For the given example the answer would be: 7: d6; a6, f11, h3, i6. Score: Your sum minus 25.
12. Colobox’s path *
Place numbers from 1 to 7 into the grid. Same numbers cannot be in one row or column. We will get the map of hilly area (each number shows the height of hill in corresponding cell). Choose any cell for start. Colobox can start to roll down (the next number must be less than previous). After rolling down it can continue rolling forward until the top. Top is the cell having number greater than two neighboring in corresponding direction (greater then one neighbor if the cell is at the edge). At the top Colobox can change direction and roll down in any direction. The path is the line consists of vertical and horizontal segments going throw the centres of cell. Path can intersect but cannot retrace itself. Maximize the length of the path.
Answer format: First write the length of the path, then content of the grid row by row and then the coordinates of the cells where Colobox have changed directions (including start and finish cells). For the given example the answer would be: 16:41523,13452,52134,24315,35241; a1-a3-e3-e1-c1-c4-e4-e5 Score: (S-30)/3, where S is the length of the path. * Colobox is the character of Russian tales. It is a baked ball. This puzzle is devoted to the authors friend – vocalist of the band «Forgotten Colobox»
You must send answers via email in simple text with this format: Name: Ivan Ivanov E-mail: email@example.com Country: Russia 1. ... 2. ... .... 12. ... Best two puzzles: 1,2 Worst two puzzles: 3,4 At the end of the email you can write any commentary. Thank you for your participation.
This action might not be possible to undo. Are you sure you want to continue?
We've moved you to where you read on your other device.
Get the full title to continue reading from where you left off, or restart the preview.