Author: Tom Likens
Date: 10:34:38 12/05/02
Go up one level in this thread
On December 04, 2002 at 20:05:14, Russell Reagan wrote: >Let me see if I understand what forward pruning accomplishes. I understand how >it works. Forward pruning only reduces the time to depth (and nodes to depth), >but it doesn't produce a more accurate score when searching to a fixed depth. In >other words, if you had a choice of the two following options: > >1. 10-ply search using no forward pruning >2. 10-ply search using null-move > >and all other things being equal, then choice 1 would potentially be the more >accurate 10 ply result. Is this correct? Russell, I'm not sure I understand the question. Null-move is a form of forward pruning (unlike alpha-beta which is a backwards pruning method that produces the same value as a pure mini-max search). Are you asking which would be better 1. A 10-ply null-move search without *additional* forward pruning. 2. Or a 10-ply null-move search with extra forward pruning. I think the most accurate fixed-depth search would be a full-width search without *any* forward pruning. Any type of forward pruning, including the null-move heuristic, has the potential to throw away a possibly winning move. regards, --tom
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.