Author: Dann Corbit
Date: 17:28:36 10/10/03
Go up one level in this thread
On October 10, 2003 at 20:09:29, Edward Seid wrote: >I've been working on a solution to the Pawn Game. > >Using only negamax with alpha-beta pruning (no transposition tables yet), I've >been able to solve the 6 vs 6 pawn game. It took about 1 hour and 1 billion >nodes. I was curious to see if my rudimentary algorithm would be able to find >the solution to the 7 vs 7 pawn game. So I set up the following position and >let my AMD 1900+ loose on it. > >[D]8/ppppppp1/8/8/8/8/PPPPPPP1/8 w - - >Guess what happened after 105 TRILLION nodes and many days? >OutOfBoundsException! > >When generating moves, my moveList array has an upperbound of 15, allowing for >16 possible moves. > >After the moves >1. d4 d5 >2. e4 dxe4 >3. d5 a5 >4. b3 a4 >5. f3 axb3 >6. d6 > >the position becomes >[D]8/1pp1ppp1/3P4/8/4p3/1p3P2/P1P3P1/8 b - - >and Black has 17 possible moves. I guess I shouldn't be so cheap with my array >space :( You see things like that a lot. FEN or EPD strings only allowed to be 80 characters Maximum search depth of some small number of plies like 50 Maximum moves allowed of 100 (even though 256 will fit into an unsigned char) etc. Memory is cheap.
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.