ICGA Journal - Volume 28, issue 3

Authors: van den Herik, Jaap

Article Type: Other

DOI: 10.3233/ICG-2005-28301

Citation: ICGA Journal, vol. 28, no. 3, pp. 129-130, 2005

Authors: Hyatt, Robert M. | Cozzie, A.

Article Type: Research Article

Abstract: Hash signature collisions have been feared in computer-chess programs, dating back to the early Greenblatt program, and continuing until today. The fear has been that a signature collision, where the hashing function can take two different chess-board positions and produce the same hash signature, will produce errors in the tree search that will lead to gross playing errors and result in inferior play. As a result, chess programmers have spent significant amounts of time trying to reduce these signature collisions as far as possible (since a chess position cannot be uniquely stored in 64 or fewer bits, it is impossible …to avoid all signature collisions). This research was done to answer the question: “Is it really worth all the effort to bring down the number of signature collisions to an absolute minimum?” The answer is surprising. Show more

DOI: 10.3233/ICG-2005-28302

Citation: ICGA Journal, vol. 28, no. 3, pp. 131-139, 2005

Authors: Fang, Haw-ren

Article Type: Research Article

Abstract: There are two rule sets in Chinese chess: the Asian rule set and the Chinese rule set. The part-one article gives an algorithm to build the complete win-draw-loss databases in accord with the Asian rule set. The required theorems and lemmas to support the theory are also presented. However, with only win-draw-loss information available, one player may rove in the win states but never win the game by checkmate, stalemate, or force the opponent to violate the special rules. In this part-two article, the algorithm to build infallible databases in accord with the Asian rule set is accompanied by an …infallible playing scheme. A verification algorithm is given together with the statistics of 50 endgame databases. Show more

DOI: 10.3233/ICG-2005-28303

Citation: ICGA Journal, vol. 28, no. 3, pp. 140-152, 2005

Authors: Haworth, G. McC.

Article Type: Research Article

Abstract: Eugene Nalimov has completed the computation of a set of endgame tables for 6-man chess, and independently, Marc Bourzutschky has completed tables for 3-3 chess and for 4-2 chess where Black is not just ‘KP’. The ICGA salutes both achievements and looks ahead.

DOI: 10.3233/ICG-2005-28304

Citation: ICGA Journal, vol. 28, no. 3, pp. 153-153, 2005

Authors: Li, Chung-Chih | Koh, Hikyoo

Article Type: Research Article

Abstract: We present a new idea for opening play to improve the playing strength of computer Go programs. It uses a collection of canonical sequences (Joseki) and their deviations. Instead of trivially matching opening moves played to the collected sequences, we define a notion of similarity to extract the most suitable move from the candidate sequences. The simplicity of our method and its positive outcome make our approach a promising tool to be integrated in a complete computer Go program.

DOI: 10.3233/ICG-2005-28305

Citation: ICGA Journal, vol. 28, no. 3, pp. 154-158, 2005

Authors: Hartmann, Dap

Article Type: Book Review

DOI: 10.3233/ICG-2005-28306

Citation: ICGA Journal, vol. 28, no. 3, pp. 159-160, 2005

Article Type: Other

DOI: 10.3233/ICG-2005-28307

Citation: ICGA Journal, vol. 28, no. 3, pp. 161-161, 2005

Authors: Björnsson, Yngvi | van den Herik, Jaap

Article Type: Other

DOI: 10.3233/ICG-2005-28308

Citation: ICGA Journal, vol. 28, no. 3, pp. 162-175, 2005

Authors: Iida, Hiroyuki

Article Type: Other

DOI: 10.3233/ICG-2005-28309

Citation: ICGA Journal, vol. 28, no. 3, pp. 176-176, 2005

Authors: van den Herik, H.J. | Hellemons, J.W.

Article Type: Other

DOI: 10.3233/ICG-2005-28310

Citation: ICGA Journal, vol. 28, no. 3, pp. 177-177, 2005