21 Sep 08
Originally posted by tomtom2321. h4 g5 2. hxg5 h5 3. gxh6 Rxh6 4. Rxh6 Nxh6 5. g4 Nxg4 6. Nf3 Nxf2 7. Ng5
Compose a proof game and the one who solves it must compose one of his own and so on and so forth.
We will once again start of simple.
[fen]rnbqkb2/ppppp3/8/5p2/8/7N/PPPPP3/RNBQKB2 w Qq - 0 9[/fen]
Reach this position in 8 moves... It should be solved in the time it takes to tie your shoe.
Nh3 8. Nxh3 f5
Mine is:
PG in 29.5 moves [position after White's 30th move]
21 Sep 08
Originally posted by SwissGambitTo see the board I have to paste the fen into chessbase but chessbase is calling it illegal and will not allow me to paste it.... Is there any way you could maybe fix the fen? Maybe chessbase is just faulty although this hasn't happened before.
1. h4 g5 2. hxg5 h5 3. gxh6 Rxh6 4. Rxh6 Nxh6 5. g4 Nxg4 6. Nf3 Nxf2 7. Ng5
Nh3 8. Nxh3 f5
Mine is:
[fen]kr3n2/1qp1pB1p/b3pnB1/5p2/3B3K/N1PPP1PB/1r1PN2R/5q1R[/fen]
PG in 29.5 moves [position after White's 30th move]
21 Sep 08
1 edit
Originally posted by tomtom232Add " w - - 0 1" to the end of the FEN, then paste it in.
To see the board I have to paste the fen into chessbase but chessbase is calling it illegal and will not allow me to paste it.... Is there any way you could maybe fix the fen? Maybe chessbase is just faulty although this hasn't happened before.
Edit: It worked fine in my ChessBase without anything added.
21 Sep 08
Originally posted by SwissGambitI have the board now and so far the only thing I have come up with is that one bishop must have prompted on the e8 square and the other on the g8 square... But I could be wrong as I am not very good at solving proof games. I'll give it my best shot though.
Add " w - - 0 1" to the end of the FEN, then paste it in.
Edit: It worked fine in my ChessBase without anything added.
22 Sep 08
1 edit
Originally posted by tomtom232Yeah, this one is tough. Normally, length and difficulty don't necessarily correlate, but a sound problem of nearly 30 moves takes a lot of careful planning to both compose and solve. [This one is computer tested, in case anyone was wondering.]
I have the board now and so far the only thing I have come up with is that one bishop must have prompted on the e8 square and the other on the g8 square... But I could be wrong as I am not very good at solving proof games. I'll give it my best shot though.
22 Sep 08
Originally posted by SwissGambitI have also decided that the black queen is definitely not on its original promotion square and must have promoted on a1. I am thinking that
Yeah, this one is tough. Normally, length and difficulty don't necessarily correlate, but a sound problem of nearly 30 moves takes a lot of careful planning to both compose and solve. [This one is computer tested, in case anyone was wondering.]
30.Bf7 was whites last move and 29...Qf1 was blacks last move.
22 Sep 08
Originally posted by SwissGambitHow do you computer test the quickest way to reach a position?
Yeah, this one is tough. Normally, length and difficulty don't necessarily correlate, but a sound problem of nearly 30 moves takes a lot of careful planning to both compose and solve. [This one is computer tested, in case anyone was wondering.]
22 Sep 08
Originally posted by UriesI am sure there are settings on Fritz or maybe specialty engines that allow you to feed it a position and have it find the quickest variation... To pass the test there should only be one variation given for the amount of moves stipulated because its not necessarily the quickest.... You might be able to get the same position one move earlier which means you would have to find a way to "lose" a move or on move later which means you would have to find a way to "gain" a move.
How do you computer test the quickest way to reach a position?