Skip to main content

A Theory of Evaluative Comments in Chess with a Note on Minimaxing

  • Chapter
Computer Chess Compendium
  • 715 Accesses

Abstract

Classical game theory partitions the set of legal chess positions into three evaluative categories: won, drawn and lost. Yet chess commentators employ a much larger repertoire of evaluative terms than this, distinguishing (for example) a ‘drawn’ from a ‘balanced’ position, a ‘decisive’ from a’ slight’ advantage, an ‘inaccuracy’ from a ‘mistake’ and a ‘mistake’ from a ‘blunder’. As an extension of the classical theory, a model of fallible play is developed. Using this, an additional quantity can in principle be associated with each position, so that we have not only its ‘game-theoretic value’ but also its ‘expected utility’. A function of these two variables can be found which yields explications for many evaluative terms used by chess commentators. The same model can be used as the basis of computer play. It is shown to be easier to justify, and to adjust to realistic situations, than the minimax model on which state of the art chess programs are based.

First published in The Computer Journal, volume 24, number 3, 1981, pp. 278-286. Copyright Heyden & Son Ltd., 1981. Reprinted by permission of John Wiley & Sons Ltd.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 64.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 84.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

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Authors

Editor information

David Levy

Rights and permissions

Reprints and permissions

Copyright information

© 1988 David Levy

About this chapter

Cite this chapter

Michie, D. (1988). A Theory of Evaluative Comments in Chess with a Note on Minimaxing. In: Levy, D. (eds) Computer Chess Compendium. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-1968-0_16

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-1968-0_16

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4757-1970-3

  • Online ISBN: 978-1-4757-1968-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics