Author: Bo Persson
Date: 11:12:49 08/30/00
Go up one level in this thread
On August 30, 2000 at 05:41:01, Severi Salminen wrote: >>>>Why do you add a value depending on depth (2^depth)? Why not just increment by >>>>1? Just asking because I'm new to chess programming techniques and I'm starting >>>>to program my own creature... >>>> >>>>Severi >>> >>>I believe the idea was to give higher weights to nodes near the root since they >>>are not updated as often. >>> >> >>and they are also more important, as they are *still* good with a deeper search >>tree below them. > >Oh, I got it. I thought it was the depth in which the cut off was found, not the >depth remaining below that node... > >So is this what basically happens: >1. you generate pseudo-moves >2. you give captures a big priority plus Or, generate just capture moves and search the good ones (whatever that means) first. >3. you add the corresponding history value from history[from][to] to priority >value >4. make the best move Or, generate remaining moves scan the new part of the move list and select the move with the highest history score. repeat 3-4 times. >5. inc history value in array if cutoff found (or fail high) yes >6. after search decrease history values a bit > >Right? Yes. >Severi
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.