Author: Daniel Kang
Date: 11:37:45 11/21/00
Go up one level in this thread
On November 21, 2000 at 09:31:33, Sven Reichard wrote: >On November 20, 2000 at 23:24:49, Daniel Kang wrote: > >>Also, alpha-beta pruning allows one to arrive at a correct minimax solution >>without having to search the entire tree, so your math is a bit off there as >>well. >It still needs to search (b/2)^n nodes, if b is the branching factor, and n is >the depth in plies, *even assuming* optimal move ordering. So the math wasn't >that much off after all. >Sven. I'm not sure what your point is. That's a huge difference in complexity (assuming, of course (sqrt(b))^n or b^(n/2)). Saying it was "a bit off" was probably too generous. Dan.
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.