ChessProblems.ca organizes a 45-days thematic series-movers online tournament, to celebrate Cornel Pacurar's 45th
There are two sections, one for compositions with normal force and one for compositions with promoted force, with 3 book prizes each.
To enter the competition in either section, a series-mover with not less than 45 moves is required.
Any series stipulation, as well as either one fairy condition (with some exceptions, as outlined below) or one type of fairy piece, supported by Popeye, is allowed.
All compositions should have a unique solution in "n-1" moves, and no solution in "n" moves.
The tournament will last for 45 days.
Start date and time: February 20th, 2010, at 00:00 GMT
End date and time: April 5th, 2010, at 23:59:59 GMT
There will be no exceptions, new submissions after the deadline will not be accepted.
There will be three book prizes for each section.
The Theme and the Rules
||The tournament is open for compositions with any series stipulation supported by Popeye v4.55, having a unique solution in "n-1" moves and no solution in "n" moves, where "n" is greater than or equal to 45.
||There are two sections: Section 1 for compositions with normal force and Section 2 for compositions with promoted force.
||While not mandatory, in each section either one fairy condition or one type of fairy piece is allowed, but not both (fairy condition and fairy piece).|
The following fairy conditions are excluded: Grid Chess (all forms: regular and irregular grids, ContactGridChess etc), Edgemover (both Black and White), KoeKo and NewKoeko, Minimummer and Maximummer (both Black and White) and Forced Squares (both Black and White).
The following fairy pieces are excluded: Dummy and Edgehog.
The criteria used to decide the ranking within each section is as follows:
1) The number of moves: the more, the better!
2) Compositions with king not in check in the initial position are preferred over compositions having the same number of moves, but with king in check (which is allowed).
3) The number of pieces: the less, the better!
4) The date and the time of sending: the earlier, the better!
Other aspects of the economy of force (i.e. total number and type of figures, number of promoted figures or number of fairy pieces) are not taken into consideration.
||There are 3 book prizes for each section, decided entirely by the above criteria.
||Only compositions with a unique solution in n-1 moves and no duals are accepted. The presence of other shorter solutions (n-2, n-3 etc) is not acceptable.
||Only normal 8x8 chessboards are allowed.
||All initial positions must be legal under the rules of chess. While the legality aspect is more relaxed in the fairy realm, please note, however, that in Section 1
the total number of pawns and fairy pieces should not exceed 8, for each side. Similarly, in Section 2, the total number of pawns, promoted units and fairy pieces should not exceed 8, for each side.
||Promotions during solution are, of course, acceptable.
||Joint compositions are accepted. This tournament is open for both individuals and for teams. However, a composer can only participate as either part of a team or individually, but not both.
||Computers are allowed and encouraged for both validation of the intended solution and for composing!
||Only Popeye v4.55 compositions are accepted (C+ preferred!). Other solving programs (i.e. WinChloe) may support a wider range of stipulations/aims/fairy conditions/fairy pieces, but those are commercial programs and are not widely used and available.
Submission of entries
Please send your entries to tt2
), in the following format:
TT2 [Section / Number of moves / Total number of pieces]
Position: [Forsyth (if possible) or algebraic notation]
Condition: [if any]
To the best of our knowledge, the first two series-movers having a unique solution in "n-1" moves and no solution in "n" moves were published by two Canadian composers, François Labelle and Cornel Pacurar, in August 2008, at the end of Itamar Faybish's 3rd series-mover TT:
François Labelle & Computer
ifaybish TT3, 2008
ser-h=13 Lortap (2+2)
Solution in 12 moves: 1.c6-c5 2.c5-c4 3.c4-c3 4.c3-c2 5.c2-c1=S 6.Sc1-d3 7.Sd3-e5 8.Se5-f7 9.Kg8-f8 10.Kf8-e8 11.Sf7-d6 12.Sd6-c8 Kc7*c8 =
No solution in 13 moves!
ifaybish TT3, 2008
ser-h=31 Lortap (13+2)
Solution in 30 moves: 1.Kh1-h2 2.Kh2-h3 3.Kh3*h4 4.Kh4-h5 5.Kh5-h6 6.Kh6-h7 7.Kh7*h8 8.Kh8-h7 9.Kh7-h6 10.Kh6-h5 11.Kh5-h4 12.Kh4-h3 13.Kh3-h2 14.Kh2*g1 15.Kg1-f2 16.Kf2-e1 17.Ke1-d1 18.Kd1*c1 19.Kc1-b1 20.Kb1*a2 21.Ka2*a1 22.Ka1-a2 23.Ka2*a3 24.Ka3*a4 25.Ka4*a5 26.Ka5*b6 27.Kb6*a7 28.Ka7-b6 29.Kb6-a5 30.b7-b6 Bf1-b5 =
No solution in 31 moves!
Obviously, the two problems above (recently republished in feenschach
176!) would have not qualified for this tournament, both having less than 45 moves.
As an example, a problem that (barely!) meets the criteria for Section 1 is shown below:
ser-z e6 45
Solution in 44 moves: 1.Ke8-d8 2.Kd8-c8 3.Kc8-b8 4.Kb8-a7 5.Ka7-a6 6.Ka6-a5 7.Ka5-a4 8.Ka4-a3 9.Ka3-b2 10.Kb2-c1 11.Kc1-d2 12.Kd2-e3 13.Ke3*f4 14.Kf4-e3 15.Ke3-d2 16.Kd2-c1 17.Kc1-b2 18.Kb2-a3 19.Ka3-a4 20.Ka4-a5 21.Ka5-a6 22.Ka6-a7 23.Ka7-b8 24.Kb8-c8 25.Kc8-d8 26.Kd8-e8 27.Ke8*f8 28.Kf8-e8 29.Ke8-d8 30.Kd8-c8 31.Kc8-b8 32.Kb8-a7 33.Ka7-a6 34.Ka6-a5 35.Ka5-a4 36.Ka4-a3 37.Ka3-b2 38.Kb2-c1 39.Kc1-d2 40.Kd2-e3 41.Ke3-f4 42.Kf4-g5 43.Kg5-f6 44.Kf6-e6 z
No solution in 45 moves!
To see the results of ChessProblems.ca TT1, please click here
2010 Series-Movers Informal Tourney
ChessProblems.ca also organizes a Series-Movers Informal Tourney, open for series-movers of any type and with any fairy conditions and pieces!
Details and first entries at originals.chessproblems.ca