chess static evaluator wanted

Article View: net.chess

Article #710

#710

From: Bruce Nemnich
Date: Wed, 13 Feb 1985 09:10

11 lines
1061 bytes

I would like to do some work on chess algorithms for a very-fine-grained
parallel architecture we are working on here.  I would like to worry
more about methods of exploiting the architecture than reinventing
reasonable chess algorithms.

I could also be interested in other similar games (checkers, go, ...).
Please let me know if code is available; any language will do.

-- 
--Bruce Nemnich, Thinking Machines Corporation, Cambridge, MA
  ihnp4!godot!bruce, bjn@mit-mc.arpa ... soon to be bruce@tm.arpa

Technical Details

Message-ID: <961@godot.UUCP>

Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!cbosgd!ihnp4!godot!bruce

Show Full Headers

Complete Article Headers

Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Posting-Version: version B 2.10.2 9/17/84; site godot.UUCP
Path: arc1-ca.pugleaf.net!utzoo!watmath!clyde!cbosgd!ihnp4!godot!bruce
From: bruce@godot.UUCP (Bruce Nemnich)
Newsgroups: net.chess,net.ai,net.wanted.sources
Subject: chess static evaluator wanted
Message-ID: <961@godot.UUCP>
Date: Wed, 13-Feb-85 04:10:51 EST
Article-I.D.: godot.961
Posted: Wed Feb 13 04:10:51 1985
Date-Received: Thu, 14-Feb-85 01:34:30 EST
Distribution: net
Organization: Thinking Machines, Cambridge, MA
Lines: 11