Skip Navigation

The Computer Journal 1979 22(1):71-75; doi:10.1093/comjnl/22.1.71
© 1979 by British Computer Society
This Article
Right arrow Full Text (PDF)
Right arrow Alert me when this article is cited
Right arrow Alert me if a correction is posted
Services
Right arrow Email this article to a friend
Right arrow Similar articles in this journal
Right arrow Similar articles in ISI Web of Science
Right arrow Alert me to new issues of the journal
Right arrow Add to My Personal Archive
Right arrow Download to citation manager
Right arrowRequest Permissions
Google Scholar
Right arrow Articles by Bell, A. G.
Right arrow Articles by Jacobi, N.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

How to read, make and store chess moves

A. G. Bell1 * and N. Jacobi2 §

1 Computing Services, University of Sheffield, The Hicks Building, Sheffield, UK, 2 Department of Economics, University of Newcastle, Newcastle, Australia

A vast wealth of knowledge lies untapped in the chess libraries of the world. This paper discusses some simple techniques which could allow computers to access, verify and share this information.

Received October 1977.

* Division of Computing Research, CSIRO Canberra, Australia; now at Computing Services, University of Sheffield, The Hicks Building, Sheffield S10 2TN.

§ Department of Economics, University of Newcastle, Newcastle, N.S.W., Australia


Add to CiteULike CiteULike   Add to Connotea Connotea   Add to Del.icio.us Del.icio.us    What's this?




Disclaimer: Please note that abstracts for content published before 1996 were created through digital scanning and may therefore not exactly replicate the text of the original print issues. All efforts have been made to ensure accuracy, but the Publisher will not be held responsible for any remaining inaccuracies. If you require any further clarification, please contact our Customer Services Department.