Advertisement

Scalable Search in Computer Chess

Algorithmic Enhancements and Experiments at High Search Dephts

  • Authors
  • Ernst A. Heinz

Part of the Computational Intelligence book series (CI)

Table of contents

  1. Front Matter
    Pages I-XVIII
  2. Summary and Contributions

    1. Ernst A. Heinz
      Pages 1-6
  3. Computer-Chess Primer

    1. Ernst A. Heinz
      Pages 7-26
  4. Forward Pruning without Tears

    1. Front Matter
      Pages 27-27
    2. Ernst A. Heinz
      Pages 29-40
    3. Ernst A. Heinz
      Pages 41-51
    4. Ernst A. Heinz
      Pages 53-61
  5. Integration of Perfect Knowledge

    1. Front Matter
      Pages 63-63
    2. Ernst A. Heinz
      Pages 65-81
    3. Ernst A. Heinz
      Pages 83-98
    4. Ernst A. Heinz
      Pages 99-120
  6. Search Behaviour at Increasing Depths

    1. Front Matter
      Pages 121-121
    2. Ernst A. Heinz
      Pages 123-144
    3. Ernst A. Heinz
      Pages 145-156
    4. Ernst A. Heinz
      Pages 157-179
    5. Ernst A. Heinz
      Pages 181-182
  7. Appendices

    1. Front Matter
      Pages 183-183
    2. Ernst A. Heinz
      Pages 185-198
    3. Ernst A. Heinz
      Pages 199-200
    4. Ernst A. Heinz
      Pages 201-202
    5. Ernst A. Heinz
      Pages 203-242
  8. Back Matter
    Pages 243-270

About this book

Introduction

The book presents new results of computer-chess research in the areas of selective forward pruning, the efficient application of game-theoretical knowledge, and the behaviour of the search at increasing depths. It shows how to make sophisticated game-tree searchers more scalable at ever higher depths. Throughout the whole book, the high-speed and master-strength chess program "DarkThought" serves as a realistic test vehicle to conduct numerous experiments at unprecedented search depths. The extensive experimental evaluations provide convincing empirical evidence for the practical usefulness of the presented techniques.
Advantages: - presentation of advanced and brand-new research results
in computer chess (e.g. selective pruning and other
search enhancements, improved endgame databases, etc.)

- numerous experiments at unprecedented search depths

- extensive experimental evaluation

- practical usefulness of new techniques proven within
strong state-of-the-art chess program "DarkThought"

- includes detailed implementation skeletons in ANSI-C

- contains concise introductions into the game of chess
and the basics of computer chess in general

Keywords

Computational Intelligence Computer Chess DarkThought Pruning Scalability Search Search Behaviour algorithms behavior cognition computational intelligence computer computer chess database intelligence knowledge material research

Bibliographic information

  • DOI https://doi.org/10.1007/978-3-322-90178-1
  • Copyright Information Vieweg+Teubner Verlag | Springer Fachmedien Wiesbaden GmbH, Wiesbaden 2000
  • Publisher Name Vieweg+Teubner Verlag, Wiesbaden
  • eBook Packages Springer Book Archive
  • Print ISBN 978-3-528-05732-9
  • Online ISBN 978-3-322-90178-1
  • Buy this book on publisher's site