ICGA Journal - Volume 33, issue 1

Article Type: Other

DOI: 10.3233/ICG-2010-33101

Citation: ICGA Journal, vol. 33, no. 1, pp. 1-2, 2010

Authors: Reul, Fritz

Article Type: Research Article

Abstract: The development and analysis of a static exchange evaluator (SEE) is a challenging issue. The SEE is an important module of the computer-chess architecture for the qualitative and quantitative evaluation of moves and threatened squares. By means of the αβ-window, on which the static exchange evaluation is based, it is also possible to implement pruning conditions. The benefit of these pruning conditions is a reduction of the iterative computation. This article deals with the theoretical elements and the implementation of different SEE algorithms.

DOI: 10.3233/ICG-2010-33102

Citation: ICGA Journal, vol. 33, no. 1, pp. 3-17, 2010

Authors: Wang, Jiao | Li, Si-Zhong | Xu, Xin-He

Article Type: Research Article

Abstract: The rise of attention for Chinese-Chess programs has resulted in the development of some effective algorithms. This article presents a new algorithm named A Minors Hash Table . It is an innovation to the well-known hash-table technique; the new ideas are tuned with the help of the Chinese-Chess programs NEU CHESS and QI XING . For the sake of generality, we mention that the algorithm is applicable to almost all other Chinese-Chess programs (other than NEU CHESS and QI XING ) without facing the difficulty of code modification. The algorithm might increase the speed of almost every program …by more than 10 per cent, and this leads to a significant performance improvement. The article describes the design, the operations, the complexity, the efficiency, and in particular the Minors hash-collision prevention in parallel search related to the Minors Hash Table. The results of our experiments show that the proposed algorithm is reliable and stable. Show more

DOI: 10.3233/ICG-2010-33103

Citation: ICGA Journal, vol. 33, no. 1, pp. 18-33, 2010

Authors: Takenaga, Yasuhiko | Mori, Hikari | Iwata, Shigeki

Article Type: Research Article

Abstract: Stonehenge is a two-player game in which players alternately place a piece on an intersection of the lines drawn on the game board. The player who dominates more than half of the lines wins the game. In this note, we first present the result of exhaustive computations of Stonehenge: for all first moves, the winner of the game is computed, and the results show that the first player has a winning strategy. Second, we consider Generalized Stonehenge played on a hypergraph and prove its PSPACE-completeness.

DOI: 10.3233/ICG-2010-33104

Citation: ICGA Journal, vol. 33, no. 1, pp. 34-41, 2010

Authors: Hartmann, Dap

Article Type: Book Review

DOI: 10.3233/ICG-2010-33105

Citation: ICGA Journal, vol. 33, no. 1, pp. 42-43, 2010

Article Type: Other

DOI: 10.3233/ICG-2010-33106

Citation: ICGA Journal, vol. 33, no. 1, pp. 44-44, 2010

Authors: Syed, Omar

Article Type: Other

DOI: 10.3233/ICG-2010-33107

Citation: ICGA Journal, vol. 33, no. 1, pp. 45-46, 2010

Authors: Wan, Mei-Hui | Lee, Chang-Shing | Wang, Yuan-Liang | Cheng, Ming-Chi | Teytaud, Olivier | Yen, Shi-Jim

Article Type: Other

Abstract: This report describes the games played in the context of “The 2010 Invited Games for MO GO TW vs. Human Go Players”, held at the National University of Tainan (NUTN), Taiwan, on March 21, 2010. Twenty-four Go players ranking from 1D(Dan) to 3D were invited to challenge the computer-Go program MO GO TW by playing 9 × 9 games to validate whether MO GO TW has reached the level 1D, 2D, or 3D, based on the amateur Taiwanese scale (see Photo 1). The games results were convincing. MO GO TW won 23 out of 24 games. Therefore, MO GO TW …was awarded the 1D, 2D, and 3D certificates by the Taiwanese Go Association at the Haifong Weiqi Academy on April 2, 2010. In the future, the team members of MO GO TW (both in Taiwan and France) will continue to improve the current weaknesses of MO GO TW to let computer Go achieve similar results or better as computer chess and Chinese chess. Show more

DOI: 10.3233/ICG-2010-33108

Citation: ICGA Journal, vol. 33, no. 1, pp. 47-50, 2010

Article Type: Other

DOI: 10.3233/ICG-2010-33109

Citation: ICGA Journal, vol. 33, no. 1, pp. 51-55, 2010

Article Type: Other

DOI: 10.3233/ICG-2010-33110

Citation: ICGA Journal, vol. 33, no. 1, pp. 55-55, 2010