Author: Joshua Shriver
Date: 21:47:41 06/04/04
I've been studying chess algorithms for about 1.5 year or so. While following typical software engineering methods I've been developing a strong plan of action. (Yeah that might seem like a long term, but since this is a hobby time is something I can donate to perfection). Since speed and tree depth is the key in chess development, I've been gearing my research toward distributed programming. At the current time, I've gone through basic algorithm design and trying to create an x86/PPC assembly and C based inftrastructure. While at the same time keeping it designed toward x-node parallization. I'm at the point now, where I think I have enough knowledge gathered, hoping to start coding soon. My goal is to have my engine playing by Halloween of 2004, with a cluster of at least 5 nodes (1 master node and 4 slave nodes: money pending). lol can't understimate a person with a goal and willing to work at Wendy's and McD'S for 60-80's week to get a good cluster built. I'm looking for further advice, particularly on bitmaps and distributed programming. Any comments appreciated. Sincerely, Joshua Shriver
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.