Author: Severi Salminen
Date: 02:41:01 08/30/00
Go up one level in this thread
>>>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 3. you add the corresponding history value from history[from][to] to priority value 4. make the best move 5. inc history value in array if cutoff found (or fail high) 6. after search decrease history values a bit Right? Severi
This page took 0.01 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.