Author: Stuart Cracraft
Date: 18:38:42 07/27/04
Go up one level in this thread
On July 27, 2004 at 00:08:15, Peter Alloysius wrote: >On July 26, 2004 at 23:28:04, Stuart Cracraft wrote: > >>I visited Aske Plaat's site and slapped MTD(f) into my >>program, keeping the existing PVS/NEGASCOUNT in lieu of implementing >>his AlphaBetaWithMemory(). This is perfectly okay according to Aske. >> > >you should implement his AlphaBetaWithMemory(), or your program will take >9999999 iterations to find mate value. If value found by alphabeta is above beta >or below alpha, return that real value, not the alpha/beta. Exactly. And things do look somewhat better with the return alpha/beta vs. return value under conditional compilation. As the other author has pointed out, instabilities still abound with the current implementation and it is no where near PVSNEGASCOUT in performance nor reliability in its early form, obviously. But good call and a good laugh.
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.