Author: ALI MIRAFZALI
Date: 14:13:02 09/17/05
Go up one level in this thread
On September 17, 2005 at 12:49:06, Ryan B. wrote: >I thought this rediculess theory was proven wrong with the Crafty vs Rebel thing >a long time ago. It is far more complicated than just the NPS loss in move >ording, pruning, reduction checks, and extention checks that all can improve a >program while reducing the NPS. As well what is known by the eval function and >how it is used can be much more valuable than even another few ply searched but >causing a very large loss in NPS. Hiarcs on slow hardware vs GNU Chess on fast >hardware should show a good example of this. Yes Ryan you are very correct ;but note that Hyatt and the DeepBlue Supporters are baseing their arguments about the strength of Deep Blue on its Speed.
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.