Author: Ratko V Tomic
Date: 15:22:46 10/28/00
A Crafty using TCP/IP and peer-to-peer (P2P) distributed algorithms, deploying, say, 100,000 or more processors and hundreds of terrabytes of table-base space. There has been rising interest in P2P of late, including Intel and O'Reilly P2P conferences (cf. http://www.oreillynet.com/pub/a/linux/2000/09/22/p2psummit.html also http://www.oreillynet.com/p2p/ ). Intel, in particular seems interested in distributed processing application of P2P. Being the top guru on distributed & parallel chess algorithms since the Cray Blitz days, if you have time, that could be an interesting project, for you and many others well beyond the computer chess world. Then there could be a match Kramnik vs Internet (or vs P2P Crafty or vs Net Crafty). The effective algorithms here would likely be quite different than anything seen on regular multiprocessors due to drastically different ratios of local/global memory access speeds as well as the huge difference in the maximum bulk computing power (or storage) for the two configurations.
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.