Author: rasjid chan
Date: 10:29:29 11/17/03
Go up one level in this thread
On November 17, 2003 at 07:30:59, Daniel Shawul wrote: >you are right,i meant deeper? Do you know any good place sir? >i have found rebel's programming >topics(http://members.home.nl/matador/chess840.htm) but you know >they evaluate each node of the tree,which is quite costy for my program. >Also I tried to reduce the search depth by 1,if >score + margin < alpha for depths greater than 3.But no improvement at all since >I have to use a margin of atleast a queen to assure safety. > >regards >Daniel I joined this board only a week ago, much to late as silly problems in the past prevented me from getiing thru. Trust Ed Schroder !, there cannot be a better place generally. It showed the heart of a top program, evaluation, move-ordering, a good/correct search algorithm - MAYBE nothing else. I meddle with snailchess long before you and it failed to pull away from the TSCP benchmark. Ed made it crystal clear that ONE top program gives much significance to reduction and extentions, that's it. Your problem may not be in reductions alone, but may be in general overall implemetations. You never know if serious bugs offset what should actually work. I am now re-working based on what's from Ed's gem-of-an-article. Rasjid
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.