Author: Janosch Zwerensky
Date: 01:13:28 08/02/01
Go up one level in this thread
Hi, >(...) >But don't imagine brute force mini-max. I know they had some selective extensions, but didn't they do a 14-ply brute-force minimax base search? And wouldn't that mean that DB was using most of its processing power on that brute force search (since an alpha-beta pruned 14-ply game tree should contain something like 70 billion nodes, which would take a machine doing 200 Meganodes/second around 350 seconds to search through)? Regards, Janosch.
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.