Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: Root move ordering

Author: Daniel Mehrmannn

Date: 06:23:57 09/27/04

Go up one level in this thread


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 :))

I do node counting with homer, a new, at the monent not avaible engine, too.
Node counting speeds up (+20%) my engine. But that not the only think i'll do at
Rootdepth. I allso remember other best moves from older depths. I check this
moves approximately to my best move.

We could say i put these moves after the best move and don't look so importent
to the subtree size (scores and killers near the current depth will be pointed
too  and many more....)

Its a little bit complicated formula ;)

I'm evaluate my time management with this too.

Daniel



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.