International puzzlers community
You are not logged in.
I have just returned from Moscow where I suddenly won Moscow Cup, my first title ever. This tournament was held by Ivan Grischenko, former holder of this Cup. Full table of results, puzzles and photos are coming soon.
Offline
![]()
![]()
![]()
well done !!!
congratulations
stefano
Offline
Yes, I also congratulate Vladimir. In the final he was great.
Offline
Great news. Congrats!
Offline
Each of 5 qualifying parts lasted 35 minutes.
Part 1. Assorted
1. Snake
2. Tree
3. Domino
4. Two cubes
5. Pills
6. Subtraction
7. Policemen
8. ABC-connections
9. Shops
10. Rectangles
11. Robots
12. Multiplication
1,2,3,5,8,12 are quite standard, so here are the descriptions of the rest.
4. Two cubes
Construct two cubes using the given elements. Each cube consists of two elements.
6. Subtraction
Reconstruct the expression. All digis are drawn as shown above, but are partially erased. (Note: for addition there is also unique answer (according to A.Bogdanov, I didn't check), so you can try to solve it this way too).
7. Policemen
Each policeman standing at the crossing, observes all the convergent streets. Place four policemen so that every street is observed.
9. Shops
Starting from any parking (closest crossing to P-sign) visit all the shops (black rectangles) and finish you route at another parking. Some streets allow only one-way traffic. The route cannot cross or retrace itself.
10. Rectangles
Divide the grid into some rectangles of different sizes (XxY and YxX simultaneously are also not allowed), so that each rectangle contains any number of digits equal to its height and width (but at least one digit per rectangle).
11. Robots
There are five robots in the grid (marked by letters A,B,C,D,X). The goal is to lead robot X to the marked cell. Each robot can move horizontally or vertically until it sets against another robot (there are no walls outside the grid!) Robots can move in any order.
If there are questions about the puzzles I treat as classic - feel free to ask.
Translation of instructions for the rest of the parts are coming soon.
Offline
forsmarts wrote:
1,2,3,5,8,12 are quite standard, so here are the descriptions of the rest.
In 5 I was confused because two pills have no digits. This is not new, but I think it should be mentioned.
And also for 8 one special condition was added - each cell of the grid should be used.
Offline
forsmarts wrote:
Each of 5 qualifying parts lasted 35 minutes.
In the docs it's written 30 minutes.
So, 30 or 35 is correct?
Offline
OK, I wil try myself.
Where can I see the results to compare with?
Offline
To have something to compare with - the results of the qualification are attached.
A little bit about regulations of the qualification: the result of each competitor was the total of 4 best positions. There is the column called Corrections, I don't quite understand it, I guess it has something with the first positions of each round. Anyway, exactly these corrections brought Andrey higher than Riad and secured his second place in semifinals (the first was mine).
Offline
forsmarts wrote:
exactly these corrections brought Andrey higher than Riad
Yes, and I think this is not correct. I think more fair in the case of equal results would be consideretion of all five results, or total sum of the points. Unfrotunately I did not notice this during competition - I was too nervous.
Offline
Part 2. Easy as ABC
In the puzzles 1-7,10 you have to place letters ABCDE
In the puzzle 8 letters ABCD are used, and in the puzzles 9,11 letters ABC should be used
1. Standard Easy as ABC (first letter)
2. Second letter
3. Third letter
4. Fourth letter
5. Fifth letter ![]()
6. Different letters (from the top - 2nd, from the bottom - 4th, from left - 1st, from right - 3rd)
7-9. Triangular
10. Pentagonal (see the example, it's unexplainable
)
11. Hexagonal
Offline
Part 3. Tents
For all the puzzles, except the first one, difference from standard rules is given.
1. Standard Tents
2. Tents can share corners.
3. Each tree has one tent, which can be bound through the side or corner.
4. Each tree has two tents, which can be bound through the side or corner.
5. Each tree has three tents, which can be bound through the side or corner. Numbers outside show the maximal number of tents for the rows and columns.
6. Hexagonal. Each tree has two tents.
7. Triangular. Each tree has two tents, which can be bound through the side or corner.
Offline
Part 4. 15 puzzles of the same type. The grids should be filled with the digits 1 through 9, which can be repeated as many times as needed. The sums of the digits for all rows, columns and diagonals are given.
Part 5. 3 optimizes.
1. Draw the standard snake (not touching or crossing itself) of any size in any of four given grids. Count your score starting with the head: if digit in the next cell is bigger - plus 2 points, if it is equal - no additional points, if it is less - minus 2 points. Maximize your score.
2. Select any digit. Starting with one of them make move like chess rook in any direction until you meet your digit. Then you have to turn 90 degrees (left or right) and again move until you meet your digit. You cannot visit cells with your digit twice. Maximize the number of moves. This number is your score.
3. Place in the grid the given shape, which can be rotated, but cannot be reflected. Maximize the sum (S) of covered digits. Your score: S/2 - 20.
Offline