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.

1

The condition: VerticalMirrorCirce, must be used, and no others. The solution must not work without it.

This condition is the same as Circe, except that the rebirth square is on the vertical mirror from the normal place. It changes quite a lot of things.

One can use any of five stipulations for categories A and B:

• 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.
• ser-hs= Black plays always, except on the next to last move where White plays and forces Black to stalemate him. The last move by Black must be unique.
• ser-hs# Black plays always, except on the next to last move where White plays and forces Black to mate him. The last move by Black must be unique.

And any of five Parry series stipulations for category C, those are the same as above, except that Black can give checks before the end of the game, in which case White must parry those, either by moving the King, or intercepting the piece giving check:

• pser-h=
• pser-h#
• pser-h!=
• phser-s=
• phser-s#

The aim being to find the problems with the most points.

Points are defined as follow:

For categories A and B, it is the sum of the number of moves that each black piece moves, with 7 being the maximum for each.

For example, if the King plays 20 moves, a Knight 4 moves, another Knight 12 moves, and a Pawn 9 moves (the promoted piece is considered to be the same piece), then in total we would have: 7 + 4 + 7 + 7= 25 points.

For category C, white moves are also taken in account! And also with 7 maximum per piece. Thus if the white King moves 13 times, only 7 points are accredited. Nevertheless, the solution must be unique again in the number of black moves.

Castling is a special case. We would define it as follow for points: it is worth just one point, that one can decide to take in consideration for either the Rook, or the King.

Thus the maximum number of points for categories A and B is: 7x16=112. For category C theoretically it is 14x16, although that would be quite surely impossible in practice, at least for humans and non quantum computers.

The length of the problem is nevertheless the second criteria (more the better), and the number of pieces the third (less the better).

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

Promotions are of course ok!

3

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

4

No fairy pieces allowed.

5

8x8 board only.

6

Here are the categories:

For all, only non-promoted pieces initially.

• 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 black 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 points, the better.
For categories A and B: b) More moves, the better.
For category C: b) More moves by Black + White, the better.
c) Less total pieces the better.
d) The date of sending.
e) The flip of an (unbiased) coin (never got to use that one till now :-) ).