﻿﻿ MatPlus.Net

Website founded by
Milan Velimirović
in 2006

19:31 UTC
 ISC 2020

Remember me

 CHESS SOLVINGTournamentsRating lists1-Apr-2020
 B P C F

MatPlus.Net Forum Competitions Quick Composing TT-235 (#5-n, h#5-n, s#5-n) C. 31-12-2019

### Quick Composing TT-235 (#5-n, h#5-n, s#5-n) C. 31-12-2019

Editorial board of international web project "SuperProblem" (http://superproblem.ru/index-en.html) announces a quick composing New Year tourney for direct mates, help- and selfmates.

Awards will be published on the website http://superproblem.ru

View the announcement on the link http://superproblem.ru/htm/announcements/our_tourneys-2019.html#TT-235

One question: A capture by Black in the last move (mating move) of a s# is also not allowed?

(3) Posted by Aleksey Oganesjan [Wednesday, Nov 20, 2019 19:22]

Yes, it's also not allowed.

Castling is also a non-reversible move, but it is allowed?

I waited for such question :)

As we know due to some problems (https://www.yacpdb.org/#424634, https://pdb.dieschwalbe.de/search.jsp?expression=PROBID=%27P1087146%27), a castling is a reversible move - King and Rook can return on its initial squares! :))

But it is a joke, of course - a possibility of castling disappears after such "uncastling". And also this possibility disappears after "usual" reversible moves - as in Petrovic's masterpiece (https://www.yacpdb.org/#67373).

But I decided not to overload the conditions of this "light" New Year tourney by "bulky" formulations about rare cases. So yes, in this TT a castling is allowed.

It is not recommended to use castling if you want to compose the longest problem.

Why, Olaf?

The number of possible positions is restricted. Most likely the winning position will not have king and rook on their inital squares.

Most likely in all genres the best tablebase diggers and users of computer-aided composing will win, so I suggest to split the tourney at least in two sections .... positions with <= 8 pieces and compositions with > 8 pieces.

It's interesting suggesting, Frank. I'll think about it.

But you must admit: if an author himself (without tablebases!) composed a long 8 (or less)-pieces-problem then he will be offended to be ranked as "digger" :)

We all are "diggers" ... so it would be no problem (at least for me).

if an author himself (without tablebases!) composed a long 8 (or less)-pieces-problem then he will ... NOT WIN