Position-Value Representation in Opening Books

  • Thomas R. Lincke
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2883)


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.


Search Engine Leaf Node Start Position Interior Node Hasse Diagram 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Berliner, H.: The B* tree search algorithm: A best-first proof procedure. Artificial Intelligence 12, 23–40 (1979)CrossRefMathSciNetGoogle Scholar
  2. 2.
    Buro, M.: Toward Opening Book Learning. International Computer Chess Association Journal 22, 98–102 (1999)Google Scholar
  3. 3.
    Lincke, T.: Strategies for the automatic construction of opening books. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 74–86. Springer, Heidelberg (2002)CrossRefGoogle Scholar
  4. 4.
    Beal, D.F.: Mixing heuristic and perfect evaluations: Nested minimax. International Computer Chess Association Journal 7, 10–15 (1984)Google Scholar
  5. 5.
    Stanley, R.: Enumerative Combinatorics. Cambridge Studies in Advanced Mathematics, vol. 1(49). Cambridge University Press, Cambridge (1997)zbMATHGoogle Scholar
  6. 6.
    Breuker, D., van den Herik, J., Uiterwijk, J., Allis, V.: A solution to the GHI problem for best-first search. In: van den Herik, H.J., Iida, H. (eds.) CG 1998. LNCS, vol. 1558, pp. 25–49. Springer, Heidelberg (1999)CrossRefGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

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

Personalised recommendations