Author: Miguel A. Ballicora
Date: 14:40:39 01/09/02
Go up one level in this thread
On January 09, 2002 at 17:11:36, Russell Reagan wrote: >On January 09, 2002 at 12:50:12, David Hanley wrote: > >>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 > >Let's think about this for a moment. If you knew for a fact that your program >had perfect move ordering, then you could always assume that the move at the top >of your list was correct. Therefore you wouldn't even have to search, but if you >did, an 8 ply search would take a handful of milliseconds and consume a whopping >8 nodes (depending on how you count your nodes). You wouldn't even have to use >alpha-beta (or any other kind of search) if you _KNEW_ that your move ordering >was perfect. You could always choose the move at the top of the list, and your >program would play perfect chess. Maybe this isn't what you were thinking when >you said "perfect move ordering". > >Russell It was a theoretical question. Miguel
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.