Author: Matthew White
Date: 15:14:09 10/21/03
Go up one level in this thread
On October 21, 2003 at 09:09:48, Earl Fuller wrote: >With the new AMD 64 bit CPU having been released, it begs another question ! >Will it be possible to extend the search horizon so the chess programs can see >deeper into the game, in the same amount of time ? Interesting, don't you >think! >Because i am not a chess programmer perhaps this question may seem naive to >those of you who are ! However having said that, it's always been my >understanding that speed and memory were a key factor into how far a chess >program can see ahead! "Because of the fine balance the chess programers most >adhere to based on the speed and ram available to them". So, if this is true, >then would it be correct to say that the "potential", for a greater horizon >into the game is possible ? If this is true, then the quality of the endgame >will increase, middle game planning ! The amount of chess knowledge in the >program will be able to be increased because the program will be able to access >more information in the same amount of time and not get into time trouble ! The >next few years should prove interesting in the field of chess programming ! >Earl Don't think of 64 bit processors as a panacea. It is merely another incremental improvement at this point. Much of the improvement, as Uri pointed out has been algorithmic rather than pure hardware improvement. Even with hardware created especially for searching chess trees (I'm not going to name it, since it is a notorious debate topic), we didn't get that far into the chess tree. Yes, that particular hardware was designed to search wide and not necessarily deep, but still, faster processors with wider registers don't mean that the game is on the verge of being solved. Matt
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.