Abstract
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.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Berliner, H.: The B* tree search algorithm: A best-first proof procedure. Artificial Intelligence 12, 23–40 (1979)
Buro, M.: Toward Opening Book Learning. International Computer Chess Association Journal 22, 98–102 (1999)
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)
Beal, D.F.: Mixing heuristic and perfect evaluations: Nested minimax. International Computer Chess Association Journal 7, 10–15 (1984)
Stanley, R.: Enumerative Combinatorics. Cambridge Studies in Advanced Mathematics, vol. 1(49). Cambridge University Press, Cambridge (1997)
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)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
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. https://doi.org/10.1007/978-3-540-40031-8_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-40031-8_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-20545-6
Online ISBN: 978-3-540-40031-8
eBook Packages: Springer Book Archive