Author: Edward Seid
Date: 18:04:19 09/18/03
Go up one level in this thread
On September 18, 2003 at 15:32:28, Ricardo Gibert wrote: >>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" > Derived from Uri's game, and modified for the new rule #2. [D]4k3/pppppppp/8/8/8/8/PPPPPPPP/4K3 w - - 0 1 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.h3 a6 10.h4 a5 11.h5 a4 12.b3 g6 13.b4 g5 14.b5 g4 15.b6 g3 16.c3 f6 17.c4 f5 18.c5 f4 19.c6 f3 20.exf3 dxc6 21.f4 c5 22.f5 c4 23.f6 c3 24.f3 c6 25.f4 c5 26.f5 c4 27.d3 e6 28.d4 e5 29.d5 e4 30.d6 e3 31.d7+ 1-0 Number of legal moves at each ply 1. 16 16 2. 15 15 3. 15 15 4. 14 14 5. 14 13 6. 11 11 7. 12 12 8. 13 14 9. 15 15 10. 14 14 11. 14 14 12. 13 13 13. 12 11 14. 10 10 15. 10 11 16. 12 12 17. 11 11 18. 11 10 19. 10 9 20. 9 8 21. 7 7 22. 8 8 23. 9 10 24. 11 10 25. 8 8 26. 8 8 27. 6 7 28. 5 5 29. 5 4 30. 4 4 16^2 * 15^6 * 14^8 * 13^4 * 12^5 * 11^8 * 10^7 * 9^3 * 8^7 * 7^3 * 6 * 5^3 * 4^3 = 1.65 x 10^60
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.