ChessBrain was formed in January 2002 to investigate distributed computing concepts, including distributed game tree search, using a network of volunteer contributors linked together over the Internet. The project brought together a worldwide team of experts to work on the various aspects of the task in parallel. The most important components being the distributed communication protocol, client verification and security components, and the chess-playing engine itself.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Shannon, C.E.: “Programming a Computer for Playing Chess”, Philosophical Magazine, Ser.7, Vol. 41, No. 314, March (1950)
Beal, D. F. “Advances in Computer Chess 2,” Chapter “An Analysis of Mini- max”, pp. 103-109. Edinburgh University Press, (1980)
Fraenkel, A. S. & Lichtenstein, D., “Computing a perfect strategy for n*n chess requires time exponential” Proc. 8th Int. Coll. Automata, Languages, and Pro- gramming, Springer LNCS 115 (1981) 278-293 and J. Comb. Th. A 31 199-214. (1981)
Newell, A., Shaw J.C., & Simon, H.A. “Chess-playing programs and the problem of complexity.” IBM J. Res. Develop. 2:320-25, (1958)
Campbell, M., Joseph Hoane Jr., A., Hsu, F., “Deep Blue”, Artificial Intelligence 134 (1-2), (2002)
Brockington, M., “Asynchronous Parallel Game Tree Search”, PhD Thesis, University of Alberts, (1997)
Barabasi, A-L. “Linked: The new Science of Networks”, Cambridge, MA: Perseus (2002)
Gladwell, M. “The Tipping Point”, Boston: Little and Company (2000)
Rivest, R. L., “S-Expressions”., MIT Theory group, http://theory.lcs.mit.edu/~rivest/sexp.txt
Session Initiation Protocol (SIP) http://www.cs.columbia.edu/sip/
Feldmann, R., Mysliwietz, P., Monien, B., “A Fully Distributed Chess Pro- gram”, Advances in Computer Chess 6, (1991)
Feldmann, R., Mysliwietz, P., Monien, B., “Studying overheads in massively par- allel MIN/MAX-tree evaluation”, Proc. 6th annual ACM symposium on Parallel algorithms and architectures, (1994)
Berkeley Open Infrastructure for Network Computing (BOINC) project: http://boinc.berkeley.edu/
Justiniano, C., “Tapping the Matrix”, O’Reilly Network Technical Articles, 16th, 23rd April 2004. http://www.oreillynet.com/pub/au/1812
Justiniano, C., “Tapping the Matrix: Revisited”, BoF LinuxForum, Copenhagen (2005)
Lew, K., Justiniano, C., Frayn, C.M., “Early experiences with clusters and com- pute farms in ChessBrain II”. BoF LinuxForum, Copenhagen (2005)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this chapter
Cite this chapter
Frayn, C., Justiniano, C. (2007). The ChessBrain Project — Massively Distributed Chess Tree Search. In: Baba, N., Jain, L.C., Handa, H. (eds) Advanced Intelligent Paradigms in Computer Games. Studies in Computational Intelligence, vol 71. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-72705-7_5
Download citation
DOI: https://doi.org/10.1007/978-3-540-72705-7_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-72704-0
Online ISBN: 978-3-540-72705-7
eBook Packages: EngineeringEngineering (R0)