Author: David Hanley
Date: 08:25:23 01/10/02
Go up one level in this thread
I understand what you mean, but that is not why i was askign the question. Suppose you ran one search, and saved _all_ the move ordering info. You then ran a second search using the move ordering info from the previous search. You could then basically have a perfectly ordered tree. If you extended one ply, you would have a nearly perfect tree. I was trying to gauge the expense of saving a great deal of move ordering info from one search to the next versus the benefit. dave
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.