Author: Gerd Isenberg
Date: 11:13:08 10/14/03
Go up one level in this thread
On October 14, 2003 at 10:07:10, Ricardo Gibert wrote: > >http://www.wired.com/news/technology/0,1282,60791,00.html > >Can this be productively used in a chess program? I don't know, simular hardware ressources may be more productive for chess, if implemented as hyperthreading devices. I guess it's a kind of further development of SSE and AltiVec technology. With huge register files (N * 64 * 64|128|256-bit?) and probably SIMD-wise integer instructions (including popcount?) and fast memory interface, i can imagine that it is usefull for a lot of nice things, like some eval passes, e.g. a first square wise and a final scalar product pass. And fill-attack generation, e.g. square wise in all 16 directions with a specialiced dumb fill routine. Gerd
This page took 0.03 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.