Author: scott farrell
Date: 06:06:24 11/27/02
For example, deep blue did no forward pruning (not even null move), but lots of singular extensions. So is a program with no pruning (or minimal, just say nullmove R=2) with heaving extensions, similar to one with heaving pruning and minimal extensions? Can a program be strong without futility pruning? (I think Robert stripped all futility/razor from crafty). I remember Robert H saying (something like this): "theortically you only need to search 1 node (1 ply?), and extend it, and take your move" Are extensions (check extensions etc) just a proxy for a qsearch - are they trying to acheive the same thing (other than full width, vs reduced width) - in essence just trying to stop the horizon factor? And I know everyone quotes at plies and depth (not that I can work out how CM's output should be interpreted), but arent extensions also a proxy for iterative deepening, ie. calcing a mate in 6 from ply 6 (instead of going all the way to 12). I think at the end of the day you can get the same answer several ways: 1 + 1 = 2 (1 ply and 1 extension) 2 + 0 = 2 (straight brute force) 2 + 1 - 1 = 2 (some pruning thrown in)
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.