Author: Vincent Vega
Date: 21:21:27 02/11/00
Go up one level in this thread
On February 11, 2000 at 23:31:21, Robert Hyatt wrote: >this isn't new. We had ostrich, phoenix, then zugzwang, p.conners, waycool, >etc. Distributed search is not trivial. But it can work. I'm designing one >for crafty now to use our 8 X quad xeon cluster. It will take some time as >portability has to be factored in, but there will be a distributed crafty. Great to hear it. >You aren't going to use the internet (maybe internet2 will work) to much >distributed search as the latency is impossible. But 'clusters' will work. I think that's the problem with algorithm design. I was thinking about a "publicity" game with one move per day. Avoiding a great performance penalty if the clients would only connect to the server few times per move would be a hard problem but a solvable one, I hope. And if solved, playing today would be possible.
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.