Abstract
We propose a highly selective heuristic search algorithm for capturing problems in Go. This iterative deepening search works on the crucial chain in which the prey block is located. The algorithm starts using three order liberties of the chain as the basis of the position evaluation, the value is then adjusted by the presence of few liberty-surrounding opponent blocks. The algorithm solved most capturing problems in Kano’s four volumes of graded Go problems. Moreover, it is fast enough to be used by Go programs in real time.
This is a preview of subscription content, log in via an institution to check access.
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
Cazenave, T.: Abstract Proof Search. In: Marsland, T., Frank, I. (eds.) CG 2001. LNCS, vol. 2063, pp. 39–54. Springer, Heidelberg (2002)
Cazenave, T.: Iterative Widening. In: Nebel, B. (ed.) Proceedings of IJCAI-01, vol. 1, pp. 523–528 (2001)
Chen, K.: Group Identification in Computer Go. In: Levy, D., Beal, D. (eds.) Heuristic Programming in Artificial Intelligence, pp. 195–210. Ellis Horwood, Chichester (1989)
Chen, K.: Computer Go: Knowledge, Search, and Move Decision. ICGA Journal 24(4), 203–215 (2001)
Kano, Y.: Graded Go Problems For Beginners. In: Introductory Problems, vol. 1. Kiseido Publishing Company (1985)
Kano, Y.: Graded Go Problems For Beginners. In: Elementary Problems, vol. 2. Kiseido Publishing Company. ISBN 1985
Kano, Y.: Graded Go Problems For Beginners. In: Intermediate Problems, vol. 3. Kiseido Publishing Company (1987) ISBN 4-906574-48-3
Kano, Y.: Graded Go Problems For Beginners. In: Advanced Problems, vol. 4. Kiseido Publishing Company (1990)
Kierulf, A.: Smart Game Board: A Workbench for Game Playing Programs, with Go and Othello as Case Studies. PhD thesis, ETH Zurich (1990)
Kishimoto, A.: Correct and Efficient Search Algorithms in the Presence of Repetitions, PhD thesis, University of Alberta (2005)
Thomsen, T.: Lambda-Search in Game Trees - with Application to Go. ICGA Journal 23(4), 203–217 (2000)
Wolf, T.: Forward Pruning and Other Heuristic Search Techniques in Tsume Go. Information Sciences 122(1), 59–76 (2000)
Zobrist, A.L.: A New Hashing Method with Application for Game Playing, Techn. Rep. No. 88, Univ. of Wisconsin, Madison, 1970. Republished in 1990, ICGA Journal, 13(2):69–73 (1970)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chen, KH., Zhang, P. (2007). A New Heuristic Search Algorithm for Capturing Problems in Go. In: van den Herik, H.J., Ciancarini, P., Donkers, H.H.L.M.(. (eds) Computers and Games. CG 2006. Lecture Notes in Computer Science, vol 4630. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-75538-8_3
Download citation
DOI: https://doi.org/10.1007/978-3-540-75538-8_3
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-75537-1
Online ISBN: 978-3-540-75538-8
eBook Packages: Computer ScienceComputer Science (R0)