Author: Uri Blass
Date: 09:24:42 09/18/03
Go up one level in this thread
On September 18, 2003 at 11:58:32, Ricardo Gibert wrote: >On September 18, 2003 at 11:45:39, Ricardo Gibert wrote: > >>On September 18, 2003 at 11:25:01, Ricardo Gibert wrote: >> >>>On September 18, 2003 at 10:02:33, Edward Seid wrote: >>> >>>>I'm learning how to program by reading Deitel's Visual Basic.NET How to Program. >>>> I'm eager to try out my new skills on a chess-related project. >>>> >>>>The Pawn Game - as presented by GM Lev Alburt in Comprehensive Chess Course, Vol >>>>1 >>>> >>>>[D]8/pppppppp/8/8/8/8/PPPPPPPP/8 w - - 0 0 >>>> >>>>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 >>>> >>>>The game is drawn if: >>>>1- both sides' pawns are blocked so that neither side can make any moves >>>> >>>>The programming exercise I've assigned to myself it to try to solve this game >>>>using brute-force minimax. My question to you... can this game be solved on >>>>today's typical desktop computer using brute-force? >>>> >>>>I've been thinking about this and have made the following observations: >>>>1- while classical chess has a branching factor of around 30, the Pawn Game >>>>branching factor is 16 in the initial position, and around 8 in the >>>>'middlegame', and goes down with each capture. >>>>2- the longest 'game' is certainly less than 81 ply, and is probably around >>>>60-65 (81 ply is calculated by the impossible scenario of each side taking 40 >>>>ply each to march all pawns to the 7th rank + 1 ply to promote) >>> >>> >>>Unless I've suffered from a brain fart, a 42 ply game is impossible, while a 41 >>>ply game is trivial to construct. >> >> >>Wrong! I'm up to 67 ply being possible. > >I miscounted. I can do 66. I can do 73 [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
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.