[Retros] recent improvements
mri_two at t-online.de
Sun Dec 17 08:41:51 EST 2006
> However, Francois Labelle's (& Mario Richter's?) programs have not spoken
> this discussion. Tasks of this kind ought to be tractable in the same way
> that massacre positions proved to be. Basically, ignore any move where a
> promotion cannot be achieved in the number of moves remaining.
The problem is, that the more degrees of freedom (in the case of
MPGs non-capturing moves, in the case of 'mate by promotion' moves
that do not advance the thematical pawn) you have,
the longer the search will take.
This could be observed in the case of K+K-MPGs, were the 33 plies
case could be completely investigated in less than 10s, while the
next step, 34 plies, already required approx. 10min.
Nevertheless, at least up to 10 plies Francois Labelle surely
knows the answer.
(s. www.cs.berkeley.edu/~flab/chess/statistics-positions.html )
Just out of curiosity (and because Andrew asked for it) I let my own
Computing all games, that end with mate by pawn promotion,
- 9 plies 2s
- 10 plies 42s
- 11 plies 1h 50min
The way my program works there is some extra time needed for
post-processing the result sets to find the the uniquely
Here my results:
Realizable in 9 plies
Realizable in 10 plies
Realizable in 11 plies
More information about the Retros