Abstract
We have built a distributed chess program running over a network of workstations. The program consists of several independent “advising” processes each using different chess knowledge to evaluate the position; each evaluator offers its advice to a coordinating process, that uses a selection policy to choose the move. We have built the advisors redistributing the knowledge included in a strong sequential program. We have made experiments with several different knowledge distributions and move selection policies. Some programs we built are sensibly stronger than the sequential program from which we started using seven workstations only. ——— 1. cianca@cs.unibo.it Experiments in distributing and coordinating knowledge UBLCS-94-13 2
Sign-in/Register to access full text options 
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
