Skip Navigation

The Computer Journal 1974 17(1):80-81; doi:10.1093/comjnl/17.1.80
© 1974 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 Proskurowski, W.
Right arrow Search for Related Content
Social Bookmarking
Add to CiteULike   Add to Connotea   Add to Del.icio.us  
What's this?

Ordering method to accelerate the solution of mate-in-two chess problems by computer

W. Proskurowski *

Royal Institute of Technology, Department for Computer Sciences, S-100 44 Stockholm, Sweden

The problem of solving a mate-in-two chess problem might be described as searching a move tree with the depth limit of four or five, depending on the algorithm used. Here we describe methods to increase the probability that the order of investigation of the moves will in some way approach the best order. The gain in the computing time due to these ordering methods was substantial (at least a factor of two).

Received August 1972.

* Royal Institute of Technology, Department for Computer Sciences, S-100 44 Stockholm 70, Sweden


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.