Title: Searching for compound goals using relevancy zones in the game of Go
Authors: Ramon, Jan ×
Croonenborghs, Tom #
Issue Date: 2006
Publisher: Springer
Series Title: Lecture Notes in Computer Science vol:3846 pages:113-128
Conference: 4th International Conference on Computers and Games location:Ramat-Gan, Israel date:July 5-7, 2004
Abstract: In complex games with a high branching factor, global alphabeta search is computationally infeasible. One way to overcome this problem is by using selective goal-directed search algorithms. These goal-directed searches can use relevancy zones to determine which part of the board influences the goal. In this paper, we propose a general method that uses these relevancy zones for searching for compound goals. A compound goal is constructed from less complex atomic goals, using the standard connectives. In contrast to other approaches that treat goals separately in the search phase, compound goal search obtains exact results.
ISSN: 0302-9743
Publication status: published
KU Leuven publication type: IT
Appears in Collections:Informatics Section
Technologiecluster Computerwetenschappen
Computer Science Technology TC, Technology Campus Geel
× corresponding author
# (joint) last author

Files in This Item:
File Status SizeFormat
41320.pdf Published 276KbAdobe PDFView/Open


All items in Lirias are protected by copyright, with all rights reserved.

© Web of science