Author: Pham Minh Tri
Date: 18:53:08 11/13/00
Go up one level in this thread
Hi, Thank you all very much for your answers. From your answers, other question is: Even though using the hash table for quiescence search may save nothing (or little slower), could it improve the result by getting scores of bigger, deeper and full search trees from the hash table? Pham
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.