Author: Gian-Carlo Pascutto
Date: 15:04:40 05/15/00
Go up one level in this thread
On May 15, 2000 at 17:11:17, Dann Corbit wrote: > >>b) Because of the goofed up search the program will sometimes discover something >>new on the next ply and start failing high on a LOT of moves. If I can't >>complete the search in time, I rather trust the last ply's result than >>one of the new psuedo-good moves. > >I think this would make a very interesting heuristic study. >Find out for fail high what the probability is that you should choose that move >instead of the completed one. Hmm...I think it's better to just try to stabilise the search a bit more and do like everyone else does ;) -- GCP
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.