Author: Eric Oldre
Date: 12:10:08 08/04/04
Go up one level in this thread
On August 04, 2004 at 15:01:12, Pallav Nawani wrote: >On August 04, 2004 at 14:52:45, Cesar Contreras wrote: > >>I'm having problems figuring out how to implement an SEE, i supose you need to >>generate all moves to both sides, ordering on any way the captures, and >>calculate the captures. Any info you can add will be apreciated. >> >>Thx > >You could look at the code of Sjeng Free & Fruit. I am doing the same thing as I >also wish to implement SEE :) Looking at the fruit source helped me out a lot when coding my SEE routine, but i was amazed at what a difference it made in my tree size, a huge reduction, well worth the effort. My SEE is not very fast and my program ends of spending about 20% of it's time in the SEE function, but still it improved strength dramatically. just thought you might like the encouragement, since i know i got quite frustrated trying to code mine. Eric
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.