Author: Bo Persson
Date: 12:03:22 06/04/02
Go up one level in this thread
On June 04, 2002 at 02:26:57, Dann Corbit wrote: >On June 04, 2002 at 02:11:40, Russell Reagan wrote: > >>I've always heard, better algorithms will beat the fastest code using a less >>efficient algorithm any day (IE MinMax vs. Alpha-Beta). My question is, when do >>you stop working on algorithmic type stuff and start working solely on adding >>knowledge to your program, and focus solely on the evaluation function? > >Never. > >>Or is >>there a even point at which you stop working on things like search and only >>focus on evaluation? > >Never. > >>To me, it seems like there is only so much you can do in terms of improving the >>searching methods, improving the efficiency of various other functions that are >>used often (is square attacked, make move, generate legal moves, etc.). > >There is no known hard limit to the search efficiency, other than the search >must visit at least the number of nodes contained in the optimal path. Yes, as long as the branching factor is above 1, there is definitely room for some improvement. Bo Persson bop2@telia.com
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.