Skip to main content
SpringerLink
Log in

Computers in Chess

Solving Inexact Search Problems

  • Textbook
  • © 1984

Overview

Authors:
  1. M. M. Botvinnik

    1. c/o VAAP—Copyright Agency of the U.S.S.R., Moscow, USSR

    View author publications

    You can also search for this author in PubMed   Google Scholar

Part of the book series: Symbolic Computation (SYMBOLIC)

Part of the book sub series: Artificial Intelligence (1064)

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

Access this book

Log in via an institution
eBook USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Other ways to access

Licence this eBook for your library

Institutional subscriptions

Table of contents (6 chapters)

  1. Front Matter

    Pages i-xiv
    Download chapter PDF

  2. The General Statement

    • M. M. Botvinnik
    Pages 1-14

  3. Methods of Limiting the Search Tree

    • M. M. Botvinnik
    Pages 15-22

  4. The Search for a Solution and Historical Experience

    • M. M. Botvinnik
    Pages 23-25

  5. An Example of the Solution of an Inexact Problem (Chess)

    • M. M. Botvinnik
    Pages 26-53

  6. Three Endgame Studies (An Experiment)

    • M. M. Botvinnik
    Pages 54-61

  7. The Second World Championship

    • M. M. Botvinnik
    Pages 62-67

  8. Back Matter

    Pages 68-158
    Download chapter PDF
Back to top

Keywords

About this book

Much water has flowed over the dam since this book went to press in Moscow. One might expect that PIONEER would have made substantial advances-unfortunately it has not. There are reasons: the difficulty of the problem, the disenchantment of the mathematicians (because of the delays and drawing out of the work), and principally the insufficiency and some­ times complete lack of machine time. The general method used by PIONEER to solve complex multidimen­ sional search problems had already been formulated at that time. It was supposed that the successful completion of the chess program PIONEER-l would provide a sufficient validation for the method. We did not succeed in completing it. But, unexpectedly, PIONEER's method obtained a different kind of validation. Since our group of mathematicians works at the Institute for Electroen­ ergy, we were invited to solve some energy-related problems and were assigned the task of constructing a program that would plan the recondi­ tioning of the equipment in power stations-initially for one month. Until then, the technicians had been preparing such plans without the aid of computers. Although the chess program was not complete even after ten years, the program PIONEER-2 for computing the monthly repair schedule for the Interconnected Power System of Russian Central was completed in a few months. In mid-October of 1980 a medium-speed computer constructed the plan in 40 seconds. When, at the end of the month, the mathematician A.

Authors and Affiliations

  • c/o VAAP—Copyright Agency of the U.S.S.R., Moscow, USSR

    M. M. Botvinnik

Bibliographic Information

  • Book Title: Computers in Chess

  • Book Subtitle: Solving Inexact Search Problems

  • Authors: M. M. Botvinnik

  • Series Title: Symbolic Computation

  • DOI: https://doi.org/10.1007/978-1-4612-5204-7

  • Publisher: Springer New York, NY

  • eBook Packages: Springer Book Archive

  • Copyright Information: Springer-Verlag New York Inc. 1984

  • Softcover ISBN: 978-1-4612-9736-9Published: 26 September 2011

  • eBook ISBN: 978-1-4612-5204-7Published: 12 December 2013

  • Edition Number: 1

  • Number of Pages: XIV, 158

  • Additional Information: Title of the original Russian edition: O resenii netocnych perebornych zadac

  • Topics: Artificial Intelligence, Science, Humanities and Social Sciences, multidisciplinary

Publish with us

Policies and ethics

Back to top

Search

Navigation