Computer Chess Club Archives

Search

Terms

Messages

Subject: perfect ordering

Author: David Hanley

Date: 09:50:12 01/09/02

I have seen it claimed somewhere that with perfect move ordering, an eight ply
search would only consume a thousand nodes or so, even only alphabeta ( no
hashing or forward pruning ).

Is this so?

dave

Re: perfect ordering Russell Reagan 14:11:36 01/09/02
- Re: perfect ordering David Hanley 08:25:23 01/10/02
- Re: perfect ordering Miguel A. Ballicora 14:40:39 01/09/02
  - Re: perfect ordering Russell Reagan 16:43:54 01/09/02
    - Re: perfect ordering Miguel A. Ballicora 17:07:27 01/09/02
      - Re: perfect ordering Russell Reagan 17:28:45 01/09/02
        
        Re: perfect ordering Tony Werten 02:28:09 01/10/02
        
        Re: perfect ordering Miguel A. Ballicora 17:49:08 01/09/02
Re: perfect ordering Robert Hyatt 12:12:19 01/09/02
Re: perfect ordering William H Rogers 12:05:38 01/09/02
Re: perfect ordering Gian-Carlo Pascutto 10:55:45 01/09/02
- Re: perfect ordering David Hanley 11:32:11 01/09/02
Re: perfect ordering Vincent Diepeveen 10:04:58 01/09/02
Re: perfect ordering David Rasmussen 10:00:28 01/09/02
- Re: perfect ordering Andrew Dados 10:28:20 01/09/02
  - Re: perfect ordering David Rasmussen 11:17:03 01/09/02

This page took 0.01 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.