• Fri frakt över 249 kr
  • •
  • Snabba leveranser
  • •
  • Billiga böcker
Kundservice

Du är på sajten för privatpersoner.

Företag, bibliotek eller offentlig verksamhet?

Du handlar på classic.bokus.com, där alla dina funktioner finns intakta.
Till classic.bokus.com
Bokus logotyp. Gå till startsidan.
  • Erbjudanden
  • Nyheter
  • Student
  • Topplistor
  • Barn & ungdom
  • Bokus Play
  • E-böcker
  • Pocketböcker
  • Spel & pussel

Upp till 20% på populära nyheter →

Sidfot

Mina sidor

    Hjälp

    • Kundservice
    • Vanliga frågor och svar
    • Frakt och leverans
    • Retur vid ångerrätt
    • Reklamera vara
    • Betalning
    • Köpvillkor
    • Allmänna villkor
    • Information om webbplatsens tillgänglighet

    Om Bokus

    • Om oss
    • Pressrum
    • För studenter
    • För företag
    • För bibliotek och offentlig verksamhet
    • För leverantörer
    • Hållbarhet

    Populärt

    • Aktuella erbjudanden
    • Presentkort
    • Studentlitteratur
    • Nya böcker
    • Topplistor
    • Signerade böcker
    • Engelska böcker

    Inspiration

    • Boktips
    • BookTok
    • Populära bokserier
    • Barnbokskaraktärer
    • Populära författare

    Mina sidor

      Hjälp

      • Kundservice
      • Vanliga frågor och svar
      • Frakt och leverans
      • Retur vid ångerrätt
      • Reklamera vara
      • Betalning
      • Köpvillkor
      • Allmänna villkor
      • Information om webbplatsens tillgänglighet

      Om Bokus

      • Om oss
      • Pressrum
      • För studenter
      • För företag
      • För bibliotek och offentlig verksamhet
      • För leverantörer
      • Hållbarhet

      Populärt

      • Aktuella erbjudanden
      • Presentkort
      • Studentlitteratur
      • Nya böcker
      • Topplistor
      • Signerade böcker
      • Engelska böcker

      Inspiration

      • Boktips
      • BookTok
      • Populära bokserier
      • Barnbokskaraktärer
      • Populära författare
      Logotyp för Bokus
      Följ oss på Facebook (extern länk)Följ oss på Instagram (extern länk)Följ oss på YouTube (extern länk)Följ oss på TikTok (extern länk)
      bokus @ CookiesIntegritetspolicyKöpvillkor
      Till Citymail hemsida (extern länk)Till Budbee hemsida (extern länk)Till Postnord hemsida (extern länk)Till Schenker hemsida (extern länk)Till Early Bird hemsida (extern länk)Till Walleys hemsida (extern länk)
      1. Samhälle och politik
      2. Samhälle och kultur
      3. Kultur och medier
      4. Referensverk och tvärvetenskap

      Computers in Chess

      Solving Inexact Search Problems

      AvM. M. Botvinnik

      Häftad, Engelska, 2011

      Del i serien Symbolic Computation

      577 kr

      Beställningsvara. Skickas inom 10-15 vardagar. Fri frakt över 249 kr.

      Fler format och utgåvor

      E-bok

      739 kr

      Beskrivning

      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.

      Produktinformation

      • Utgivningsdatum:2011-09-26
      • Mått:155 x 235 x 10 mm
      • Vikt:277 g
      • Format:Häftad
      • Språk:Engelska
      • Serie:Symbolic Computation
      • Antal sidor:158
      • Förlag:Springer-Verlag New York Inc.
      • ISBN:9781461297369
      • Översättare:A. A. Brown, A. a. Brown

      Utforska kategorier

      • Referensverk och tvärvetenskap inom Samhälle och politik
      • Artificiell intelligens inom Data och IT
      • Schack inom Sport, fritid och hobby

      Innehållsförteckning

      • 1 The General Statement.- Definition of an Inexact Task.- Inexact Tasks and Control Systems.- Two Methods for Solving Inexact Problems.- The Goal of the Game and the Scoring Function.- Goal and Prognosis (The Optimal Variation).- Multi-level Control Systems.- Types of Multi-level Systems.- Advantages of the General Goal.- The Method for Connecting the Optimal Variations of the Components for Types C and E Regimes.- Computer Programs and Humans.- The Expansion of Artifical Intelligence.- 2 Methods for Limiting the Search Tree.- Truncation.- The Goal of an Inexact Game.- The Scoring Function.- Breaking Off a Variation.- The Pruning of Branches.- The Horizon.- Two Trees: The Mathematical Model (MM).- The Stratification of the System.- Three General Limitation Principles.- Improving the Results of a Search.- 3 The Search for a Solution and Historical Experience.- The Search for a Solution by Association.- The Handbook Method of Searching.- 4 An Example of the Solution of an Inexact Problem (Chess).- A. The Search for a Move in an Original Situation.- B. The Use of Historical Experience.- 5 Three Endgame Studies (An Experiment).- 6 The Second World Championship.- KAISSA-CHESS 4.6.- Conclusions.- Appendix 1.- Fields of Play (by B. M. Stilman).- 1. The Formation of Fields and the Search Within Them.- 1.1. The Concept of a Field.- 1.2. The Search Procedure in the Initial Position.- 1.3. The Formation of Fields During the Search—An Example.- 1.4. Formation of a Field.- 1.5. Storage of Information about Sheaves of Trajectories in Computer Memory. Linked Lists.- 1.6. Information on the Trajectories of a Field.- 1.8. Computing the Length of a Denial Trajectory.- 1.9. Correction of the Sighting Method.- 1.10. The Pseudosearch.- 1.11. The Extent of the Climb Up a Branch in thePseudosearch.- 1.14. Freezing a Trajectory for Lack of a Connection to an Active One.- 1.15. Criteria for Freezing.- 1.16. The Algorithm for Freezing.- 1.18. Trajectory and Field.- 2. The Choice of Moves in an Ensemble of Fields (The Mathematical Model).- 2.1. The Goal of the Game and the Ending of a Variation.- 2.2. The Criteria for Breaking Off a Variation in the Search.- 2.3. Testing the Criteria for Ending a Variation.- 2.4. Pruning Branches by the Minimax Principle. On the Branch-and-Bound Method.- 2.5. Pruning Branches by the Worst Case Method.- 2.6. Priority of Moves in a Search.- 2.7. Analysis of the Trajectories of a Sheaf for Inclusion in the Search.- 2.8. Analysis of Trajectories for Forking.- 2.9. Retreat and Deblockade.- 2.10. Pruning in the Presence of Branching in a Sheaf of Trajectories.- 2.11. The Structure of the Search Tree.- 2.12. A New Content of Known Procedures.- Appendix 2 The Positional Estimate and Assignment of Priorities (by M. A. Tsfasman and B. M. Stilman).- Appendix 3 The Endgame Library in PIONEER (Using Historical Experience by the Handbook Method and the Outreach Method) (by A. D. YUDIN).- 3.1. Introduction.- 3.2. Formulation of the Problem.- 3.3. Configurations.- 3.4. The Boundary Effect. Decomposition Formulae.- 3.5. Symmetries.- 3.6. The Structure of the Library. Classes. Coding of the Information.- 3.7. Organization of the Information in the Form of Two-Dimensional Tables with Subordination of Entries.- 3.8. The Algorithm for Using the Endgame Library (The Search for Exact Coincidence).- 3.9. Examples of the Operation of the Subroutine for Using the Endgame Library.- 3.10. Outreach for a Library Position.- 3.11. The Search for Nearby Positions.- 3.12. Filter with Respect to the Pawn Structure.- 3.13. The “One Color-DifferentColor” Filter.- 3.14. Filters Within a Set of Positions.- 3.15. Finding a Group of Neighboring Positions.- 3.16. Implementation of the Outreach Method. Anti-outreach.- 3.17. Entry from the Move-Search Routine.- 3.18. Outreach and Exact Coincidence.- 3.19. The Potential for Wide Use of Library Rules in PIONEER.- 3.20. The Breakoff Criterion Based on the Rule of the Square.- 3.21. Conclusion.- Appendix An Associative Library of Fragments (by A. I. Reznitsky and A. D. Yudin).- References.- Glossary of Terms.- Index of Notation.
      Hoppa över listan

      Mer från samma författare

      M. M. Botvinnik - Asynchronized Synchronous Machines, E-bok

      Asynchronized Synchronous Machines

      M. M. Botvinnik

      E-bok
      2016

      359 kr

      M. M. Botvinnik - Meine neuen Ideen zur Schachprogrammierung, Häftad

      Meine neuen Ideen zur Schachprogrammierung

      M. M. Botvinnik

      Häftad, 1981

      593 kr

      M. M. Botvinnik - Meine neuen Ideen zur Schachprogrammierung, E-bok

      Meine neuen Ideen zur Schachprogrammierung

      M. M. Botvinnik

      E-bok
      2013

      507 kr

      Hoppa över listan

      Mer från samma serie

      Nick Cercone, Gordon McCalla - Knowledge Frontier, Inbunden

      Knowledge Frontier

      Nick Cercone, Gordon McCalla

      Inbunden, 1987

      561 kr

      Gerhard Rayna - Reduce, Häftad

      Reduce

      Gerhard Rayna

      Häftad, 1987

      1 114 kr

      Yun Peng, James A. Reggia - Abductive Inference Models for Diagnostic Problem-Solving, Inbunden

      Abductive Inference Models for Diagnostic Problem-Solving

      Yun Peng, James A. Reggia

      Inbunden, 1990

      1 148 kr

      Yun Peng, James A. Reggia - Abductive Inference Models for Diagnostic Problem-Solving, Häftad

      Abductive Inference Models for Diagnostic Problem-Solving

      Yun Peng, James A. Reggia

      Häftad, 2012

      1 147 kr

      D. Navinchandra - Exploration and Innovation in Design, Häftad

      Exploration and Innovation in Design

      D. Navinchandra

      Häftad, 2011

      577 kr

      Vipin Kumar, P.S. Gopalakrishnan, Laveen N. Kanal - Parallel Algorithms for Machine Intelligence and Vision, Häftad

      Parallel Algorithms for Machine Intelligence and Vision

      Vipin Kumar, P.S. Gopalakrishnan, Laveen N. Kanal

      Häftad, 2011

      1 147 kr

      Harvey Abramson, Veronica Dahl - Logic Grammars, Häftad

      Logic Grammars

      Harvey Abramson, Veronica Dahl

      Häftad, 2013

      577 kr

      David D. McDonald, Leonard Bolc - Natural Language Generation Systems, Häftad

      Natural Language Generation Systems

      David D. McDonald, Leonard Bolc

      Häftad, 2011

      577 kr

      Nick Cercone, Gordon McCalla - Knowledge Frontier, Häftad

      Knowledge Frontier

      Nick Cercone, Gordon McCalla

      Häftad, 2011

      577 kr

      Leveen Kanal, Vipin Kumar - Search in Artificial Intelligence, Häftad

      Search in Artificial Intelligence

      Leveen Kanal, Vipin Kumar

      Häftad, 2011

      577 kr

      Hoppa över listan

      Du kanske också är intresserad av

      M. M. Botvinnik - Computers in Chess, E-bok

      Computers in Chess

      M. M. Botvinnik

      E-bok
      2013

      739 kr

      M. M. Botvinnik - Asynchronized Synchronous Machines, E-bok

      Asynchronized Synchronous Machines

      M. M. Botvinnik

      E-bok
      2016

      359 kr

      M. M. Botvinnik - Meine neuen Ideen zur Schachprogrammierung, Häftad

      Meine neuen Ideen zur Schachprogrammierung

      M. M. Botvinnik

      Häftad, 1981

      593 kr

      M. M. Botvinnik - Meine neuen Ideen zur Schachprogrammierung, E-bok

      Meine neuen Ideen zur Schachprogrammierung

      M. M. Botvinnik

      E-bok
      2013

      507 kr

      Chun-Hung Tzeng - Theory of Heuristic Information in Game-Tree Search, Häftad

      Theory of Heuristic Information in Game-Tree Search

      Chun-Hung Tzeng

      Häftad, 2011

      561 kr

      David D. McDonald, Leonard Bolc - Natural Language Generation Systems, Häftad

      Natural Language Generation Systems

      David D. McDonald, Leonard Bolc

      Häftad, 2011

      577 kr

      Jose L. Encarnacao, Peter C. Lockemann - Engineering Databases, Häftad

      Engineering Databases

      Jose L. Encarnacao, Peter C. Lockemann

      Häftad, 2011

      1 114 kr

      Nick Cercone, Gordon McCalla - Knowledge Frontier, Häftad

      Knowledge Frontier

      Nick Cercone, Gordon McCalla

      Häftad, 2011

      577 kr

      Vipin Kumar, P.S. Gopalakrishnan, Laveen N. Kanal - Parallel Algorithms for Machine Intelligence and Vision, Häftad

      Parallel Algorithms for Machine Intelligence and Vision

      Vipin Kumar, P.S. Gopalakrishnan, Laveen N. Kanal

      Häftad, 2011

      1 147 kr

      Leonard Bolc - Natural Language Parsing Systems, Häftad

      Natural Language Parsing Systems

      Leonard Bolc

      Häftad, 2011

      1 148 kr