Position-Value Representation in Opening Books

  • Thomas R. Lincke
Conference paper

DOI: 10.1007/978-3-540-40031-8_17

Part of the Lecture Notes in Computer Science book series (LNCS, volume 2883)
Cite this paper as:
Lincke T.R. (2003) Position-Value Representation in Opening Books. In: Schaeffer J., Müller M., Björnsson Y. (eds) Computers and Games. CG 2002. Lecture Notes in Computer Science, vol 2883. Springer, Berlin, Heidelberg


The standard position-value representation in search engines uses heuristic values, proven win, proven loss and, if applicable, proven draw. The advantage of this set of values is that propagation is efficient and that the propagated information is sufficient for selecting a move in the root position. In this paper we propose a new position-value representation which is suited for the use in opening books. In an opening book, propagation speed is not as important as in a search engine. Instead we want to have values which describe as accurately as possible the knowledge we have gathered about a position. As a solution we introduce three new value types: the at-least-draw and at-most-draw, which propagate additional information when the opening book contains positions with value draw and cycle-draw, which propagates additional information when the opening book contains cycles which lead to a position repetition.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Thomas R. Lincke
    • 1
  1. 1.ETH ZürichZürichSwitzerland

Personalised recommendations