Longest Series Tournament

bar01b.gif

For the News and the Rankings, Please click here.

For all the Results, please click here. 

Introduction & History

It has been a year now since I last organized a series tournament. In the meantime there were two such tournaments, organized by Cornel Pacurar, which were most interesting and fun. More info about them can be found here.

All the series tournaments so far turned out so great, that I finally decided to organize one more time.

It will be a little bit smaller in scope, having two main categories instead of the usual four, nevertheless, I think it should give some spectacular results and matrices.

I also thought that it might be possible to create a dynamic site, where series tournaments could be run almost without any organiser, by having each composer publish his new results there, and then a page like the news page would be created dynamically. But that may be for another time :)

A certain trend in series tournaments is to let more and more freedom to the composers. For example, in the first ones a few years ago, the themes were often to find the longest series help-stalemate ending with certain specific positions.

This in itself is very interesting, and the matrices found in those tournaments showed that even with such constraints, it is possible to find a lot of original ideas.

Then more and more it was no more about the exact final position, but on certain global objectives to achieve. For example to end with only a King and Bishop for one side, and a King for the other. Or even about rare stipulations that have rarely been studied before, like Cornel's TT1.

Recently, even the stipulations and conditions have been relaxed, as an example given by Cornel's TT2, where almost anything was allowed, but given a goal that was almost never been studied, and thus giving original problems.

This tournament follows this trend, and the theme chosen is very broad. It should give a lot of freedom for composers to find original ideas, and enjoy the process of composing chess problems.

It is clear that chess composition is an art, and a beautiful one that I learned to respect a lot. Although I have very little experience in it, and mostly in the Proof Games area, where it took me a few years after I started in 2005 to really understand it a little bit better. And in Series problems, mainly through the tournaments I participated and organized since then.

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

http://www.ifaybish.com/tournament5/ (notice it is recursive, you will have to go several pages back to gather informations) for more info.

bar01b.gif

Prizes

Mechanical puzzles for the first places in the different categories and to the 1st in the table of the number of records for the categories A2, B2.

bar01b.gif

Schedule

The tournament will last 2 months.

Start: 26th of July 2010 @ 00:00 (GMT+1)
End: 25th of September 2010 @ 23:59 (GMT+1)

bar01b.gif

Computers Implication
 

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.

 

bar01b.gif

The Rules
 

1

For this tournament, queens are replaced by Sirens, rooks by Tritons, and bishops by Nereïdes. Knights and pawns are allowed as usual. Those pieces are supported by Popeye and Fancy.

They are called the marines ones. Their movements are very easy, being the same as their counterpart, except that they capture by jumping over the other pieces, on the square just after them (which must be vacant).

One can use any of three stipulations:

  • ser-h= Black plays always, except on the last move where White plays and stalemates Black.
  • ser-h# Black plays always, except on the last move where White plays and checkmates Black.
  • ser-h!= Black plays always, except on the last move where White plays and stalemates itself.

The aim being to find the longest games, using any of those stipulations, with the less total number of pieces.

One must have at least one marine piece for Black which must make at least one move during the solution, and one for White (which doesn't necessarily have to move last), in the initial position. Every piece must have a purpose, thus removing any one of them must invalidate the solution.

In addition, the condition: Circe, must be used. And the solution must not work without it.

Maximum 5 pieces in total for Black initially.

For Black only, one cannot replace any marine piece with their counterpart, and have the exact same solution. For White it is allowed.

In the news page all the info about the records will be given, except the stipulation used. Thus this will remain a mystery until the very end.

2

Before it is asked: yes, promotions are ok! But only to the allowed pieces of course.

3

The black king is allowed to be in check in the initial position.

4

8x8 board only.

5

White's last move must be legal.

6

Here are the categories:

For all, only non-promoted pieces initially. By that is meant just one siren, two tritons, and two Nereïdes maximum initially for each side. Nereïdes can be on the same square's color.

  • A1: Best problem.
  • A2: Same as A1, but for each of the total number of pieces, up to 10 pieces in total.
  • B1: Best problem in x moves, where one has a solution in x-1 moves, but no solution in x moves (check out Cornel's TT2 tournament for more info).
  • B2: Same as B1, but for each of the total number of pieces, up to 10 pieces in total.

7

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) The date of sending.
d) The flip of an (unbiased) coin.

 
bar01b.gif 

Email

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]

Example: A2/5/20/[Stipulation] means: Category A2, 5 pieces in total (including the kings), the solution is 20 moves long, and the stipulation is given at the end.

The FEN position must be the same initial position, where Sirens are replaced by queens, Tritons by rooks and Nereïdes by bishops. Unless you use WinChloë, in which case you could just send me the FEN as it is; even better :)

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

Thanks!

bar01b.gif 

Tutorial

First, which programs to use? I know of two such programs WinChloë and Popeye. WinChloë is very good, but it is not freeware. 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:

[...]

The latest Popeye (4.55) can be downloaded from the following site:

http://sourceforge.net/project/showfiles.php?group_id=200122

To use fancy is very simple, when you start it you have:

For the categories A, B, the condition will always be: Circe PromOnly si nd tr s.

The PromOnly condition simply states which pieces one is allowed to promote to, thus the three marine pieces, plus the knight.

This is of course a very simple example, with two slight problems as the Triton at c6 doesn't move at all during the solution, and both the Triton at c6 and the Nereïde at e4 are actually not needed in the position. One can nevertheless see how the Black King can pass the h7 square, which is not guarded by the Nereïde contrary to a Bishop.

Once the position and the informations are set, one needs to click on "Popeye".

The following window appears:

Notice the MaxSolutions tab. This is very useful to stop Popeye from examining more variations than needed. Then one clicks on "Try Popeye", followed by "View solution". Which gives: