Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Root move ordering

Author: Stuart Cracraft

Date: 18:38:06 09/26/04

Go up one level in this thread


On September 26, 2004 at 02:57:41, martin fierz wrote:

>On September 26, 2004 at 00:39:43, Sergei S. Markoff wrote:
>
>>How much root move ordering based on nodes count for each move improves playing
>>strength? Does anyone have results on it?
>>
>>I was in thought about this method of root moves ordering and was disguisted
>>when discovered that Dr.Hyatt invented it before me :))
>
>wow sergei, you have even more questions than i do :-)
>
>i can't answer this question, because ed schröder told me i was doing crappy
>testing when i tried to measure this. he told me to count the number of nodes
>needed in test sets to check move ordering.

I think it is important to caveat that remark with the point that
you should only count nodes if you are doing fixed-depth searches
for your testing.

I don't do fixed-depth searches. I do fixed-time searches and for
that, node-counting is not (as) effective

Stuart



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.