Experiments in Computer Amazons
Experiments in Computer Amazons
复制标题
计算机亚马逊实验
DOI:
--
复制
发表时间:
2002
期刊:
影响因子:
--
通讯作者:
Theodore Tegos
中科院分区:
文献类型:
--
作者:
M. Müuller;Theodore Tegos
Amazons is a relatively new game with some similarities to the ancient games of chess and Go. The game has become popular recently with combinatorial games researchers as well as in the computer games community. Amazons combines global full-board with local combinatorial game features. In the opening and early middle game, the playing pieces roam freely across the whole board, but later in the game they become confined to one of several small independent areas. A line segment graph is an abstract representation of a local Amazons position. Many equivalent board positions can be mapped to the same graph. We use line segment graphs to efficiently store a table of defective territories, which are important for evaluating endgame positions precisely. We describe the state of the art in the young field of computer Amazons, using our own competitive program Arrow as an example. We also discuss some unusual types of endgame and zugzwang positions that were discovered in the course of writing and testing the program.