Skip to main content
SpringerLink
Log in

Distributing search and knowledge using a coordination language

  • Conference paper
  • First Online:
Parallel Computing Technologies (PaCT 1995)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 964))

Included in the following conference series:

  • 110 Accesses

Abstract

We have compared a number of distributed chess-playing programs based on different coordination architectures. We used Linda to develop two basic coordination structures, one for distributing search and one for distributing knowledge. We claim that the approach based on knowledge distribution and coordination was successful because we had good results in two kinds of experiments:

  1. 1.

    tests on 500 middle game positions; sequential GNUChess and most simpler instances had a max solution ratio of about 20%. However, the impressive data is that more than 50% of the positions was solved by at least one instance! These data per se do not help in developing the best combination of agents, but at least they show that there is room for research and experimentation.

  2. 2.

    tournaments of 20 games between sequential GNUChess and the distributed players; some distributed players won their tournaments with clear advantages. We have found an interesting “anomaly”: distributed players built of more agents are not always stronger than players built with a smaller number of agents.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. H. Bal. Heuristic search in PARLOG using replicated worker style parallelism. Future Generation Computer Systems, 6:303–315, 1991.

    Google Scholar 

  2. N. Carriero and D. Gelernter. How to Write Parallel Programs: A First Course. MIT Press, Cambridge, MA, 1990.

    Google Scholar 

  3. C.Ebeling. All the Right Moves: A VLSI Architecture for Chess. MIT Press, 1986.

    Google Scholar 

  4. P. Ciancarini. A Comparison of Parallel Search Algorithms based on Tree Splitting. Technical Report UBLCS-94-14, Comp. Science Laboratory, Università di Bologna, Italy, May 1994.

    Google Scholar 

  5. F. Hsu. Large scale parallelization of alpha-beta search: an algorithmic and architectural study with computer chess. PhD thesis, Carnegie Mellon University, Pittsburgh, PA, Feb 1990.

    Google Scholar 

  6. G.Baudet. The Design and Analysis of Algorithms for Asynchronous Multiprocessors. PhD thesis, Carnegie-Mellon Univ., Apr 1978.

    Google Scholar 

  7. H. Bal. A comparative study of five parallel programming languages. Future Generation Computer Systems, 8:121–135, 1992.

    Google Scholar 

  8. H.Bal and R.vanRenesse. A summary of parallel alpha-beta search results. Journal of the Int. Computer Chess Association, pages 146–149, Sept 1986.

    Google Scholar 

  9. J. Schaeffer. Experiments in search and knowledge. PhD thesis, University of Alberta, Edmonton, Canada, Jul 1986.

    Google Scholar 

  10. T. Marsland and M. Campbell. Parallel search of strongly ordered game trees. ACM Computing Surveys, 14(4):533–551, 1982.

    Google Scholar 

  11. T. Marsland, M. Olafsson, and J.Schaeffer. Multiprocessor tree-search experiments. In Advances in Computer Chess 4, pages 37–51. Pergamon Press, 1986.

    Google Scholar 

  12. N. Carriero, D. Gelernter, T. Mattson, and A. Sherman. The Linda Alternative to Message-passing Systems. Parallel Computing, 20:633–655, 1994.

    Google Scholar 

  13. R. Elias. Oracol, A Chess Problem Solver in Orca. Master's thesis, Dept. of Mathematics and Computer Science, Vrije Universiteit, Amsterdam, 1990.

    Google Scholar 

  14. R.Feldmann, P.Mysliwietz, and B.Monien. Experiments with a fully-distributed chess program. In J. VanDenHerik and V. Allis, editors, Heuristic Programming in AI, pages 72–87. Ellis Horwood, 1992.

    Google Scholar 

  15. S. Akl, D. Barnard, and R. Doran. Design, analysis, and implementation of a parallel tree search algorithm. IEEE Trans. on Pattern Analysis and Machine Intelligence, 4(2):192–203, 1982.

    Google Scholar 

  16. J. Schaeffer. Experiments in distributed game-tree searching. Technical report, University of Alberta, Edmonton, Canada, Jan 1987.

    Google Scholar 

  17. J. Schaeffer. Distributed game-tree searching. Journal of Parallel and Distributed Computing, 6:90–114, 1989.

    Google Scholar 

  18. L. Stiller. Group graphs and computational symmetry on massively parallel architecture. The Journal of Supercomputing, 5:99–117, 1991.

    Google Scholar 

  19. T. Marsland, T. Breitkreutz, and S. Sutphen. A network multiprocessor for experiments in parallelism. Concurrency: Practice and Experience, 3(3):203–219, 1991.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Bologna, Italy

    P. Ciancarini

  2. Scuola Normale Superiore, Pisa, Italy

    P. Mancini

Authors
  1. P. Ciancarini
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. P. Mancini
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Victor Malyshkin

Rights and permissions

Reprints and permissions

Copyright information

© 1995 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ciancarini, P., Mancini, P. (1995). Distributing search and knowledge using a coordination language. In: Malyshkin, V. (eds) Parallel Computing Technologies. PaCT 1995. Lecture Notes in Computer Science, vol 964. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-60222-4_128

Download citation

  • DOI: https://doi.org/10.1007/3-540-60222-4_128

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-60222-4

  • Online ISBN: 978-3-540-44754-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation