Author: scott farrell
Date: 05:50:45 12/17/02
Go up one level in this thread
I cant really work out what exactly you are asking. I'll take a wild stab though. Have you looked at IID - internal iterative deepening? It goes like this: - check for best move from hashtable - if it doesnt exist do IID - IID simple does a reduced depth search of -2 - then magicaly check the hash table again, and you should have a suggested move. Hope that gives you some ideas Scott
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.