ICGA Journal - Volume 31, issue 4

Authors: van den Herik, Jaap

Article Type: Other

DOI: 10.3233/ICG-2008-31401

Citation: ICGA Journal, vol. 31, no. 4, pp. 193-194, 2008

Authors: Sturtevant, Nathan

Article Type: Research Article

Abstract: The UCT algorithm has been exceedingly popular for Go, a two-player game, significantly increasing the playing strength of Go programs in a very short time. This paper provides an analysis of the UCT algorithm in multi-player games, showing that UCT is computing a mixed-strategy equilibrium, as opposed to maxn , which computes a pure-strategy equilibrium. We analyze the performance of UCT in several known domains and show that it performs as well or better than existing algorithms. We also test several well-known UCT learning and playout rules. We suggest two criteria, branching factor and n -ply state variance. The experiments …show that they are correlated with the success of the techniques. Show more

DOI: 10.3233/ICG-2008-31402

Citation: ICGA Journal, vol. 31, no. 4, pp. 195-208, 2008

Authors: Droste, Sacha | Fürnkranz, Johannes

Article Type: Research Article

Abstract: A set of experiments for learning the values of chess pieces is described for the popular chess variants Crazyhouse Chess, Suicide Chess, and Atomic Chess. We follow an established methodology that relies on reinforcement learning from self-games. We attempt to learn piece values and the piece-square tables for three chess variants. The piece values arrived at, are quite different from those of standard chess, and in several ways surprising, but they generally outperform the values that have been previously used in the literature, and in the implementations of computer players for these games. The results also underline the practical importance …of piece-square tables for tactical variants of the game. Show more

DOI: 10.3233/ICG-2008-31403

Citation: ICGA Journal, vol. 31, no. 4, pp. 209-233, 2008

Authors: Winands, Mark H.M.

Article Type: Research Article

Abstract: Lines of Action (LOA) is a two-person zero-sum game with perfect information; it is a chess-like game with a connection-based goal. In this note the 6 × 6 variant of LOA is weakly solved. A Proof-Number search method, PN2 , is used to compute that the game is a win for the first player (Black). Based on the results of solving the boards up to 6 × 6, an optimistic time frame is given for solving 7 × 7 and 8 × 8.

DOI: 10.3233/ICG-2008-31404

Citation: ICGA Journal, vol. 31, no. 4, pp. 234-238, 2008

Article Type: Other

DOI: 10.3233/ICG-2008-31405

Citation: ICGA Journal, vol. 31, no. 4, pp. 239-239, 2008

Authors: Wu, I-Chen | Lin, Ping-Hung

Article Type: Other

DOI: 10.3233/ICG-2008-31407

Citation: ICGA Journal, vol. 31, no. 4, pp. 240-242, 2008

Article Type: Other

DOI: 10.3233/ICG-2008-31406

Citation: ICGA Journal, vol. 31, no. 4, pp. 240-240, 2008

Authors: Tillemans, Ton

Article Type: Other

DOI: 10.3233/ICG-2008-31408

Citation: ICGA Journal, vol. 31, no. 4, pp. 243-246, 2008

Authors: Lorentz, Richard J.

Article Type: Other

DOI: 10.3233/ICG-2008-31409

Citation: ICGA Journal, vol. 31, no. 4, pp. 247-247, 2008

Authors: Lee, Chang-Shing | Wang, Mei-Hui | Wang, Yuan-Liang | Hsu, Shun-Chin

Article Type: Other

DOI: 10.3233/ICG-2008-31410

Citation: ICGA Journal, vol. 31, no. 4, pp. 248-250, 2008

Authors: Schadd, Maarten | Satz, Imer

Article Type: Other

DOI: 10.3233/ICG-2008-31411

Citation: ICGA Journal, vol. 31, no. 4, pp. 251-252, 2008

Article Type: Calendar

DOI: 10.3233/ICG-2008-31412

Citation: ICGA Journal, vol. 31, no. 4, pp. 252-252, 2008

Authors: Iido, Hiroyuki

Article Type: Other

DOI: 10.3233/ICG-2008-31413

Citation: ICGA Journal, vol. 31, no. 4, pp. 253-253, 2008

Authors: Björnsson, Yngvi | Thielscher, Michael

Article Type: Other

DOI: 10.3233/ICG-2008-31414

Citation: ICGA Journal, vol. 31, no. 4, pp. 254-254, 2008

Authors: Karlsson, T.

Article Type: Other

DOI: 10.3233/ICG-2008-31415

Citation: ICGA Journal, vol. 31, no. 4, pp. 255-255, 2008