[Retros] The Case of the Mysterious Moves

[Gerd Wilts]

Dear Mario,

yes, there is indeed a close similarity to the other existing types.

Your CCC string in 7 single moves is correct. Here is another try in 9
single moves:

[-*][-*][-+][-*][x*][-*][x+][-*][-#]

BTW, the additional use of castling (as in the first problem of the original
post from Nikolai) makes the construction of such games much easier (because
it allows to determine the first moves much more strictly).

Best wishes,

Gerd


> -----Ursprungliche Nachricht-----

> Von: retros-bounces at janko.at [mailto:retros-bounces at janko.at]Im Auftrag

> von Mario Richter

> Gesendet: Montag, 2. November 2009 12:51

> An: The Retrograde Analysis Mailing List

> Betreff: Re: [Retros] The Case of the Mysterious Moves

>

>

> Dear Nikolai,

>

> this problem type is very similiar to some other types of chess problems

> that were also discussed here in the RML, like "HAP-Chess" or

> Eric Angelini's "Steno Chess".

>

> This new version could be named "CCC-Chess" (capture/castle/check).

>

> > I don't think these two need to be the last problems of their kind;

> > but it seems now (as I suspected, and you confirmed) that it is

> very hard

> > indeed to create a completely determined game which does not

> make use of castling.

>

> Using the following notation:

> a single ply is surrounded by '[' and ']',

> '-' means non-capture, 'x' means capture

> '*' stands for a non-check giving move, '+' for a check-giving move

> '#' stand for mate

>

> here is one simple CCC-string, that should be correct:

>

> [-*][-*][x*][-*][x*][-*][x#]

>

> Anybody outthere who can provide a longer, uniquely solvable CCC-String?

>

> Best,

>

>   mario

>

> _______________________________________________

> Retros mailing list

> Retros at janko.at

> http://www.pairlist.net/mailman/listinfo/retros

>