Author: Ricardo Gibert
Date: 08:27:10 09/19/03
Go up one level in this thread
On September 18, 2003 at 12:51:28, Ricardo Gibert wrote: >On September 18, 2003 at 12:35:31, Ricardo Gibert wrote: > >>On September 18, 2003 at 12:24:42, Uri Blass wrote: >> >>[snip] >> >>>I can do 73 >> >> >>I'm impressed! >> >>> >>>[Event "?"] >>>[Site "?"] >>>[Date "????.??.??"] >>>[Round "?"] >>>[White "New game"] >>>[Black "?"] >>>[Result "*"] >>>[SetUp "1"] >>>[FEN "4k3/pppppppp/8/8/8/8/PPPPPPPP/3K4 w - - 0 1"] >>>[PlyCount "73"] >>> >>>1. a3 h6 2. a4 h5 3. a5 h4 4. a6 h3 5. gxh3 bxa6 6. h4 a5 7. h5 a4 8. h6 a3 9. >>>h7 a2 10. h3 a6 11. h4 a5 12. h5 a4 13. h6 a3 14. b3 g6 15. b4 g5 16. b5 g4 17. >>>b6 g3 18. b7 g2 19. f3 c6 20. f4 c5 21. f5 c4 22. f6 c3 23. dxc3 exf6 24. c4 f5 >>>25. c5 f4 26. c6 f3 27. c7 f2 28. c3 f6 29. c4 f5 30. c5 f4 31. c6 f3 32. e3 d6 >>>33. e4 d5 34. e5 d4 35. e6 d3 36. e7 d2 37. h8=N * >>> >>> >>>Uri > > >How about the longest possible game when constrained by Tord Romstead's nice >observation that, "...Whoever manages to push a pawn to the 7th first wins." In >other words, if we redefine winning condition 2: > > The game is won by: > 1- capturing all of the opponent's pawns > 2- reaching the last rank first > 3- 'stalemating' the opponent, while still having at least > one move for yourself > >with "2- reaching the 7th rank first" This can be further generalized as "2- first to get a *passed* pawn on the nth rank while the opponent has no pawns (passed or not) on the nth or greater rank." This should further reduce the length of the longest game needed to be examined, but it is not so simple to derive what that length might be.
This page took 0 seconds to execute
Last modified: Thu, 15 Apr 21 08:11:13 -0700
Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.