Author: Edward Seid
Date: 01:28:34 09/21/03
Go up one level in this thread
On September 21, 2003 at 04:09:33, Ricardo Gibert wrote: >On September 21, 2003 at 01:00:37, Paul Byrne wrote: > >>I read the thread on the pawn game last night... >>http://www.talkchess.com/forums/1/message.html?316441 >> >>...and added it as a variant to Guildenstern (which is pretty basic >>as chess engines go, but is set up to handle rules variations like >>this -- first version took about 10 minutes). The first version >>called it a win when a pawn hit the 7th rank; changing this to >>getting a passed pawn more advanced than the opponent's most advanced >>pawn (passed or not) caused a speedup of about 100x in solving the >>couple of test positions I was using. > > >I was wondering whether or not anyone noticed this suggestion. I guess I don't >need to wonder any more. > >Very interesting. Yes, that's a great suggestion for 100x speedup! It sounds like all you guys are gonna solve this before me :( Oh well... I'm up to the Arrays chapter in my VB.NET book, which should give me a good foundation to at least start on this project. I had originally planned to use a 10x12 mailbox representation (120 element linear array), but since 1- there are no knights, and 2- the last ranks (1st and 8th) are irrelevant to the solution of the pawn game one can get away with a 6x10 representation (60 element array). Bitboards sounds too hard at my level, so I'll stick with Shannon's mailbox for now.
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.