1 problem(s) found in 1059 milliseconds (displaying 1 problem(s)). [PROBID='P1085387'] [download as LaTeX]
1. Sf3 e5 2. Sd4 Lc5 3. Sc6 bxc6 4. Sc3 La6 5. Se4 Lc4 6. Sg3 Lb3 7. axb3 De7 8. Ta4 Df8 9. Tf4 exf4 10. h3 fxg3 11. Th2 gxh2 12. h4 h1=S 13. h5 Sg3 14. h6 Sh5 15. b4 Sf4 16. bxc5 Sd3
N/M = 6/16 = 0.375





N/M = 6/16 = 0.375
Keywords: Unique Proof Game, Last Moves? (12), RIFACE Retro Composition Tourney (2009), Type C, Non-standard material (s)
Genre: Retro
Computer test: Euclide 0.93, ©2000-2002 Étienne Dupuis
FEN: rn2kqnr/p1pp1ppp/2p4P/2P5/8/3n4/1PPPPPP1/2BQKB2
Input: Gerd Wilts, 2009-06-08
Last update: A.Buchanan, 2021-04-16 more...
Genre: Retro
Computer test: Euclide 0.93, ©2000-2002 Étienne Dupuis
FEN: rn2kqnr/p1pp1ppp/2p4P/2P5/8/3n4/1PPPPPP1/2BQKB2
Input: Gerd Wilts, 2009-06-08
Last update: A.Buchanan, 2021-04-16 more...
Show statistic for complete result. Show search result faster by using ids.
https://pdb.dieschwalbe.de/search.jsp?expression=PROBID%3D%27P1085387%27
The problems of this query have been registered by the following contributors:
Gerd Wilts (1)
Also see P0001725 for a similar theme without PG. (2012-04-26)
Henrik Juel: In the shortest proof game all 32 single moves are determined, of course, but the point is that for any proof game the last 12 single moves are determined (2012-04-27)
Henrik Juel: I do not believe that Euclide can test that the last 12 moves are completely determined, so the C+ should refer to the proof game stipulation only (2012-04-27)
A.Buchanan: I like that wPc5h6 force a unique route for bSh1-d3, which makes ordering of wP moves unique. (2016-11-24)
more ...
comment