Chess Composition Series Help-Stalemate Tournament

Warning: this website will soon be removed. You can download all the 8 tournaments content in .pdf format (24 .pdf in total (each tournament has 3: Introduction, News & Results)) from:

Well, why organize another tournament so soon after the previous one?! For one thing, I am crazy. Must be... :-) Ok, maybe also because it was so interesting, that another such experience can't really hurt - hopefully -.

I won't repeat the previous introduction, which of course still holds, I redirect you to:

The idea for this one is somewhat different than the previous one. I did not have much time to explore it, but I am quite sure incredible matrices will come out of it.

No exceptions. If one sends a solution on the 1st of September at 00:00 (GMT+1), it will not be accepted.

- 150€ to the 1st in Category A1.
- 150€ to the 1st in Category B1.
- 150€ to the 1st in Category C1.
- 150€ to the 1st in Category D1.
- 150€ to the 1st in the table of the number of records for the Categories A2 and B2.
- 150€ to the 1st in the table of the number of records for the Categories C2 and D2.
- 150€ to the first competitor who reaches 50 in category A1, 40 in B1, 30 in C1, and 20 in D1.

1	Computers are only allowed in order to test the validity of a humanly found solution, that is to make it C+. Programs like Popeye and WinChloë are ok.
2	During the course of the tournament, computers are not allowed to be used for composing (that is, to "solve" or find good solutions). It is only allowed after the tournament. This needs a small clarification, of course, if one analyzes a specific position with a program, and finds other solutions (duals) which are good/better, this is ok to search further! It is the automatic search for solutions that is not allowed. Thus scripting in any way Popeye for example is also not allowed.
3	I will only accept C+ solutions. As this kind of problems are fast to check with the computer, it should not pose a problem to do so. The only exception is if one does not have a computer.

1	For the categories A and B, the goal is to find the longest series help-stalemate, using the Lortap condition, ending with maximum (not mandatory) a piece for black, and a piece for white, in addition to the kings (thus 4 pieces max in the final position). No solution of lesser number of moves must exist. Similarly for categories C and D, except that one must have at least two solutions of different number of moves, and no matrices having solutions which repeats themselves infinitely often for different number of moves.
2	Before it is asked: yes, promotions are ok!
3	The black king is allowed to be in check in the initial position.
4	Only orthodox pieces are accepted. 8x8 board only.
5	Here are the categories: a) two categories for the best solutions with visible promoted pieces, and having a unique solution. b) two categories for the best solution without visible promoted pieces, and having a unique solution. c) two categories for the best solutions with visible promoted pieces, having at least two unique solutions of different number of moves. d) two categories for the best solutions without visible promoted pieces, having at least two unique solutions of different number of moves. All initial positions must be legal under the rules of chess.
6	To decide the ranking of the different solutions, here is the order of preferences: a) More moves, the better. b) Less total pieces the better. c) Less promoted pieces, the better (categories A/C). d) Less final total number of pieces. Note that I will not give this information in the news page, only in case of a tie, it may eventually be known by induction. e) Date of sending the solution. f) In the very improbable case where all are the same, one gives a number to the position as follow: pawn=1, bishop & knight=3, rook=5, queen=9, and the less is the better. g) A pistol duel like in the old times... :-) just kidding, just kidding, it will hopefully not get to that...
7	On the 1st of July at 00:00, I will present the idea on this site.

In order to ease the "logistic" side, I would like as much as possible the following template to be used for responding:

Subject: Series Tournament: [Category/Total number of pieces/Number of moves/Number of Promoted pieces/Number of pieces in the final position]
Example: A2/5/20/3/2 means: Category A2, 5 pieces in total (including the kings), the solution is 20 moves long, there are 3 visible promoted pieces in the position, and the final position has only 2 pieces, thus only both kings are present.

Content:
<<<
Starting Position in FEN (English pieces):
Ending Position in algebraic notation:
Solution:
Comments:
...
>>>

First, which programs to use? I know of two such programs WinChloë and Popeye. WinChloë I have not yet used, although I heard it is very good. It is not freeware though. Popeye has the advantage of being free, it is very powerful and fast, but it has quite a complex syntax if one uses it through the command line (WinChloë has a GUI built in). The best would be to use a GUI program that interfaces with Popeye. I use Fancy, great tool. Its site is:

This would not be a tournament position, as white finishes with 2 pieces in addition to the king, when only 1 is allowed. In order to remain as neutral as possible, I won't give a "real" example in this tutorial. Nevertheless, the idea is there. The total number of pieces is thus 5, and the number of remaining pieces at the end: 4. It is a ser-h= stipulation, which means that black helps white to stalemate its king. White only moves on the last move. Here the game lasts 7 moves.

The Lortap condition means that a piece which is protected by another one, is not threatening anything. Thus in this position, as the white bishop on h8 is protecting the white knight on f6, this knight is not threatening anything, and the black king can take the bishop on h8 from g8. After that, this knight regains its powers.

The stipulation and condition will always be the same, only the number of moves will have to change. Do not worry about putting more moves than truly required, it is ok.

Then click on Try Popeye. If you get a "command box" with lots of solutions defiling fast, you can stop it immediately and click on "View Solution". This may give you many solutions for many number of moves, but the only interesting thing is that the one of least moves is unique.

Last but not least, good luck to all, and hopefully we will have a great tournament!