Computer Chess Club Archives

Search

Messages

Subject: Ordering Root Ply by Quiescence Moves 1-N then PV[0][0] & Node Count 2-N

Author: Stuart Cracraft

Date: 20:14:54 09/24/04

Bob wrote:

>>Initially I do a q-search after making each root move, and use this score to
>>order the moves at the root.  If I am pondering I make sure that the move from
>>the PV is put first of course.
>>
>>After each iteration, I re-order the move list keeping the best move first, and
>>ordering the rest based on the size of the sub-tree (number of nodes) each
>>produced when it was searched.

Compared with other types of move ordering for root ply 0 you did,
how did the above compare? Can you provide a general sense of the
effect/improvement you obtained.

Did you do it with Cray Blitz as well? If not, how did it order ply 0?

Stuart

• Re: Ordering Root Ply by Quiescence Moves 1-N then PV[0][0] & Node Count Robert Hyatt 19:52:59 09/26/04
• root move ordering - a small experiment martin fierz 01:24:46 09/25/04
  • Re: root move ordering - a small experiment Ed Schröder 03:36:04 09/25/04
    • Re: root move ordering - a small experiment martin fierz 04:29:54 09/25/04
      • Re: root move ordering - a small experiment Ed Schröder 05:00:56 09/25/04
        • Re: root move ordering - a small experiment martin fierz 06:02:51 09/25/04
  • Re: root move ordering - a small experiment Gian-Carlo Pascutto 02:19:48 09/25/04
  • Re: root move ordering - a small experiment Richard Pijl 02:12:23 09/25/04

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.