Author: Dieter Buerssner
Date: 13:57:22 12/25/02
Go up one level in this thread
On December 25, 2002 at 15:18:29, Robert Hyatt wrote: Uri has commented to the pruning argument. >[Fine 70]If the tree were ordered >perfectly it takes 26 plies, period... I don't agree. I actually thought rather careful about this, and I think I understand perfectly your reasoning. I gave some other argumentation in http://f11.parsimony.net/forum16635/messages/39246.htm and some other messages in that thread. This included an experiment, where my engine finds the solution of Fine 70 in 22 ply (with normal moveordering). It used 26 ply with random move ordering. Also, it used 26 ply without hash tables. The experiment was done without evaluation function (only material evaluation), and it was considered solved, when a pawn capture was found. Your argument goes like this: You need non perfect move ordering, to pick later up those inferior lines through the HT. My reasoning: Even with perfect move ordering you will pick up more than enough of those inferior lines, because any 2ndd ply, you need to search every move anyway, and find a refutation for it. Regards, Dieter
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.