Author: George Sobala
Date: 12:13:06 12/09/04
Go up one level in this thread
On December 09, 2004 at 14:40:29, Murat wrote: >On December 09, 2004 at 14:29:31, George Sobala wrote: > >> >>I'm baffled. I thought improvements in search techniques WERE programming >>improvements. The whole point is to not have to search the whole tree. So by >>crippling Fritz's selectivity you proved .. what exactly? > >I am not out here to prove anything. I tought the dedicated unit was only >capable of searching 6 ply and no deeper at the fixed level and that was my >attemt to level the playing field. > > >Murat... I think it is impossible to level the playing field in this situation. Imagine that a better programmer was able to get an engine onto the selfsame hardware, that by dint of programming improvements could search and evaluate faster and so get to a deeper ply depth just by brute force, and deeper still by being selective in its search. By restricting the search depth to 6 ply, you would have removed all the programming improvements, and crippled his program. By all means have fun and play and show us the games, but please don't draw conclusions like the "80% hardware" one!
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.